Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.
About 10,000 papers for “Runtime system”
Andrew W. Appel · 1989
The runtime data structures of the Standard ML of New Jersey compiler are simple yet general. As a result, code generators are easy to implement, programs execute quickly, garbage collectors are easy to implement and work efficiently, and a variety of runtime facilities can be provided with ease.
Cited by 0
Angelov, Krasimir · Chalmers Publication Library (Chalmers University of Technology) · 2009
Natural languages have been subject of studies for centuries\nand are hot topic even today. The demand for computer systems able to communicate directly in natural language places new challenges. Computational resources like grammars and lexicons and efficient processing tools are needed.\n\nGrammars are described as computer programs in declarative\ndomain specific languages. Just like any other programming language they require mature compilers and efficient runtime systems.\n\nThe topic of this thesis is the runtime system for the \nGrammatical Framework (GF) language. The first part of the thesis describes the semantics of the Portable Grammar Format (PGF). This is a low-level format which for GF plays the same role as the JVM bytecode for Java. The representation is designed to be as simple as possible to make it easy to write interpreters for it. The second part is for the incremetal parsing algorithm in PGF. The parser performance was always a bottle neck in GF until now. The new parser is of orders of magnitude faster than any of the previous implementations. \n\nThe last contribution of the thesis is the development of the Bulgarian resource grammar. This is the first Balkan language in the resource library and the first open-source grammar for Bulgarian. The grammar development was also an important benchmark for the development of the parsing algorithm.
Cited by 0
Andrew W. Appel · 1990
The runtime data structures of the Standard ML of New Jersey compiler are simple yet general. As a result, code generators are easy to implement, programs execute quickly, garbage collectors are easy to implement and work efficiently, and a variety of runtime facilities can be provided with ease.
Cited by 0
Angelov, Krasimir · Chalmers Research (Chalmers University of Technology) · 2009
Natural languages have been subject of studies for centuriesand are hot topic even today. The demand for computer systems able to communicate directly in natural language places new challenges. Computational resources like grammars and lexicons and efficient processing tools are needed.Grammars are described as computer programs in declarativedomain specific languages. Just like any other programming language they require mature compilers and efficient runtime systems.The topic of this thesis is the runtime system for the Grammatical Framework (GF) language. The first part of the thesis describes the semantics of the Portable Grammar Format (PGF). This is a low-level format which for GF plays the same role as the JVM bytecode for Java. The representation is designed to be as simple as possible to make it easy to write interpreters for it. The second part is for the incremetal parsing algorithm in PGF. The parser performance was always a bottle neck in GF until now. The new parser is of orders of magnitude faster than any of the previous implementations. The last contribution of the thesis is the development of the Bulgarian resource grammar. This is the first Balkan language in the resource library and the first open-source grammar for Bulgarian. The grammar development was also an important benchmark for the development of the parsing algorithm.
Cited by 0
Andrew W. Appel · Cambridge University Press eBooks · 1991
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
Cited by 1
Andrew W. Appel · LISP and Symbolic Computation · 1990
Cited by 59
Andrew W. Appel · 1990
The runtime data structures of the Standard ML of New Jersey compiler are simple yet general. As a result, code generators are easy to implement, programs execute quickly, garbage collectors are easy to implement and work efficiently, and a variety of runtime facilities can be provided with ease.
Cited by 0
Dereck Mezquita · 2024
Provides a runtime type system, allowing users to define and implement interfaces, enums, typed data.frame/data.table, as well as typed functions. This package enables stricter type checking and validation, improving code structure, robustness and reliability.
Cited by 0Open access
Ortega Berja, Daniel, Universitat Autònoma de Barcelona. Escola d'Enginyeria · Dipòsit Digital de Documents de la UAB (Universitat Autònoma de Barcelona) · 2021
Motivat per la contínua evolució en tècniques d'atac a dispositius electrònics i per la sofisticació que arriben a aconseguir, aquesta investigació es basa a aconseguir informar de les modificacions indesitjades que un atacant pugui fer a la part més important d'un sistema operatiu, el nucli. Entre els objectius del treball es buscarà que aquest codi de detecció no tingui un impacte gran en el rendiment de l'equip, adaptant-se a les càrregues existents i que sigui aplicable al mercat de les impressores d'HP. Es tindran en compte les últimes mesures de protecció com pot ser l'aïllament de taules de pàgina del nucli i aprofitarà l'arquitectura de les taules de pàgina per detectar qualsevol intent de modificació en el seu espai de memòria, situant aquest projecte entre els pocs que intenten mitigar les vulnerabilitats del nucli en dispositius que integrin una versió de Linux actualitzada.
Cited by 0Open access
Alan Humphrey, Qingyu Meng, Martin Berzins et al. · 2012
The Uintah Computational Framework was developed to provide an environment for solving fluid-structure interaction problems on structured adaptive grids on large-scale, long-running, data-intensive problems. Uintah uses a combination of fluid-flow solvers and particle-based methods for solids, together with a novel asynchronous task-based approach with fully automated load balancing. Uintah demonstrates excellent weak and strong scalability at full machine capacity on XSEDE resources such as Ranger and Kraken, and through the use of a hybrid memory approach based on a combination of MPI and Pthreads, Uintah now runs on up to 262k cores on the DOE Jaguar system. In order to extend Uintah to heterogeneous systems, with ever-increasing CPU core counts and additional onnode GPUs, a new dynamic CPU-GPU task scheduler is designed and evaluated in this study. This new scheduler enables Uintah to fully exploit these architectures with support for asynchronous, outof- order scheduling of both CPU and GPU computational tasks. A new runtime system has also been implemented with an added multi-stage queuing architecture for efficient scheduling of CPU and GPU tasks. This new runtime system automatically handles the details of asynchronous memory copies to and from the GPU and introduces a novel method of pre-fetching and preparing GPU memory prior to GPU task execution. In this study this new design is examined in the context of a developing, hierarchical GPUbased ray tracing radiation transport model that provides Uintah with additional capabilities for heat transfer and electromagnetic wave propagation. The capabilities of this new scheduler design are tested by running at large scale on the modern heterogeneous systems, Keeneland and TitanDev, with up to 360 and 960 GPUs respectively. On these systems, we demonstrate
Cited by 0
Jr-ming Guo, Pei-jen Ho, Nai-wei Lin · 2008
CCC is a high-level parallel programming language that supports both data and task parallelism. In CCC, data parallelism is specified in single-instruction-multiple-data model, while task parallelism is specified in multiple-instruction-multiple-data model. This paper describes the design of the runtime system for CCC and the implementations of the runtime system on both a symmetric multiprocessor and a symmetric multiprocessor cluster. The runtime system for CCC is based on a virtual shared memory machine that supports (distributed) shared memory and dynamic (remote) thread creation. This paper shows that based on the virtual shared memory machine, the compiler and the runtime system for CCC become highly retargetable. 1.
Cited by 0
University of Chicago · Zenodo (CERN European Organization for Nuclear Research) · 2026
This repo relates to WASL, a novel coordination technique for multi-module adaptation in multi-tenant clouds for interference mitigation. Please refer to the github link for latest updates (RECOMMENDED). The following paper can be cited: @inproceedings{DBLP:conf/icpe/Pervaiz26, author = {Ahsan Pervaiz, Anwesha Das, Vedant Kodagi, Muhammad Husni Santriaji, Henry Hoffmann}, title = {WASL: Harmonizing Uncoordinated Adaptive Modules in Multi-Tenant Cloud Systems}, booktitle = {International Conference on Performance Engineering, {ICPE}}, publisher = {{ACM/SPEC}}, year = {2026} }
Cited by 0Open access
Thomas Heinz · 2009
No abstract available.
Cited by 0
Godmar Back, Wilson C. Hsieh · ACM Transactions on Programming Languages and Systems · 2005
Single-language runtime systems, in the form of Java virtual machines, are widely deployed platforms for executing untrusted mobile code. These runtimes provide some of the features that operating systems provide: interapplication memory protection and basic system services. They do not, however, provide the ability to isolate applications from each other. Neither do they provide the ability to limit the resource consumption of applications. Consequently, the performance of current systems degrades severely in the presence of malicious or buggy code that exhibits ill-behaved resource usage. We show that Java runtime systems can be extended to support processes , and that processes can provide robust and efficient support for untrusted applications.We have designed and built KaffeOS, a Java runtime system that provides support for processes. KaffeOS isolates processes and manages the physical resources available to them: CPU and memory. Unlike existing Java virtual machines, KaffeOS can safely terminate processes without adversely affecting the integrity of the system, and it can fully reclaim a terminated process's resources. Finally, KaffeOS requires no changes to the Java language. The novel aspects of the KaffeOS architecture include the application of a user/kernel boundary as a structuring principle for runtime systems, the employment of garbage collection techniques for resource management and isolation, and a model for direct sharing of objects between untrusted applications. The difficulty in designing KaffeOS lay in balancing the goals of isolation and resource management against the goal of allowing direct sharing of objects.For the SpecJVM benchmarks, the overhead that our KaffeOS prototype incurs ranges from 0% to 25%, when compared to the open-source JVM on which it is based. We consider this overhead acceptable for the safety that KaffeOS provides. In addition, our KaffeOS prototype can scale to run more applications than running multiple JVMs. Finally, in the presence of malicious or buggy code that engages in a denial-of-service attack, KaffeOS can contain the attack, remove resources from the attacked applications, and continue to provide robust service to other clients.
Cited by 48Open access
University of Chicago · Zenodo (CERN European Organization for Nuclear Research) · 2026
This repo relates to WASL, a novel coordination technique for multi-module adaptation in multi-tenant clouds for interference mitigation. Please refer to the github link for latest updates (RECOMMENDED). The following paper can be cited: @inproceedings{DBLP:conf/icpe/Pervaiz26, author = {Ahsan Pervaiz, Anwesha Das, Vedant Kodagi, Muhammad Husni Santriaji, Henry Hoffmann}, title = {WASL: Harmonizing Uncoordinated Adaptive Modules in Multi-Tenant Cloud Systems}, booktitle = {International Conference on Performance Engineering, {ICPE}}, publisher = {{ACM/SPEC}}, year = {2026} }
Cited by 0Open access
University of Chicago · Open MIND · 2026
This repo relates to WASL, a novel coordination technique for multi-module adaptation in multi-tenant clouds for interference mitigation. Please refer to the github link for latest updates (RECOMMENDED). The following paper can be cited: @inproceedings{DBLP:conf/icpe/Pervaiz26, author = {Ahsan Pervaiz, Anwesha Das, Vedant Kodagi, Muhammad Husni Santriaji, Henry Hoffmann}, title = {WASL: Harmonizing Uncoordinated Adaptive Modules in Multi-Tenant Cloud Systems}, booktitle = {International Conference on Performance Engineering, {ICPE}}, publisher = {{ACM/SPEC}}, year = {2026} }
Cited by 0Open access
Joshua L. Levy, Hassen Saı̈di, Tomás E. Uribe · Electronic Notes in Theoretical Computer Science · 2002
Runtime verification permits checking system properties that cannot be fully verified off-line. This is particularly true when the system includes complex third-party components, such as general-purpose operating systems and software libraries, and when the properties of interest include security and performance. The challenge is to find reliable ways to monitor these properties in realistic systems. In particular, it is important to have assurance that violations will be reported when they actually occur. For instance, a monitor may not detect a security violation if the violation results from a series of system events that are not in its model. We describe how combining runtime monitors for diverse features such as memory management, security-related events, performance data, and higher-level temporal properties can result in more effective runtime verification. After discussing some basic notions for combining and relating monitors, we illustrate their application in an intrusion-tolerant Web server architecture under development at SRI.
Cited by 18Open access
Igor Schagaev, Eugene Zouev, Kaegi Thomas · 2019
Cited by 0
LEE CHEE WAI · National University of Singapore · 2000
Master's
Cited by 0
Tianyuan Li, Masih Alavy, Jeffrey A. Siegel · Building and Environment · 2019
Cited by 20