Results 1 - 10 of 1,550

Prototyping Compiler and Simulation Tools with PCCTS

by Peter J. Dahl , Peter E. Bergner , John C. Mejia, Matthew T. O'Keefe , 1994
"... This paper describes our experiences using PCCTS in our optimizing compiler and simulator development effort. The tools are used in our C front end, a code scheduler, a linker, an instruction level simulator, and a detailed cycle-level simulator. One of the Antlr grammars is used twice in the com ..."
Abstract - Add to MetaCart
This paper describes our experiences using PCCTS in our optimizing compiler and simulator development effort. The tools are used in our C front end, a code scheduler, a linker, an instruction level simulator, and a detailed cycle-level simulator. One of the Antlr grammars is used twice

Active Messages: a Mechanism for Integrated Communication and Computation

by Thorsten Von Eicken, David E. Culler, Seth Copen Goldstein, Klaus Erik Schauser , 1992
"... The design challenge for large-scale multiprocessors is (1) to minimize communication overhead, (2) allow communication to overlap computation, and (3) coordinate the two without sacrificing processor cost/performance. We show that existing message passing multiprocessors have unnecessarily high com ..."
Abstract - Cited by 1054 (75 self) - Add to MetaCart
communication costs. Research prototypes of message driven machines demonstrate low communication overhead, but poor processor cost/performance. We introduce a simple communication mechanism, Active Messages, show that it is intrinsic to both architectures, allows cost effective use of the hardware, and offers

MULTILISP: a language for concurrent symbolic computation

by Robert H. Halstead - ACM Transactions on Programming Languages and Systems , 1985
"... Multilisp is a version of the Lisp dialect Scheme extended with constructs for parallel execution. Like Scheme, Multilisp is oriented toward symbolic computation. Unlike some parallel programming languages, Multilisp incorporates constructs for causing side effects and for explicitly introducing par ..."
Abstract - Cited by 529 (1 self) - Add to MetaCart
understandable programs. Multilisp is being implemented on the 32-processor Concert multiprocessor; however, it is ulti-mately intended for use on larger multiprocessors. The current implementation, called Concert Multilisp, is complete enough to run the Multilisp compiler itself and has been run on Concert

Dynamo: A Transparent Dynamic Optimization System

by Vasanth Bala, Evelyn Duesterwald , Sanjeev Banerjia - ACM SIGPLAN NOTICES , 2000
"... We describe the design and implementation of Dynamo, a software dynamic optimization system that is capable of transparently improving the performance of a native instruction stream as it executes on the processor. The input native instruction stream to Dynamo can be dynamically generated (by a JIT ..."
Abstract - Cited by 479 (2 self) - Add to MetaCart
not require multiple runs, or any special compiler, operating system or hardware support. The Dynamo prototype presented here is a realistic implementation running on an HP PA-8000 workstation under the HPUX 10.20 operating system.

Automatic Resource Compilation by Analyzing Hyperlink Structure and Associated Text

by Soumen Chakrabarti , Byron Dom, Prabhakar Raghavan, Sridhar Rajagopalan, David Gibson, Jon Kleinberg - IN PROCEEDINGS OF THE SEVENTH INTERNATIONAL WORLD WIDE WEB CONFERENCE , 1998
"... We describe the design, prototyping and evaluation of ARC, a system for automatically compiling a list of authoritative web resources on any (sufficiently broad) topic. The goal of ARC is to compile resource lists similar to those provided by Yahoo! or Infoseek. The fundamental difference is that th ..."
Abstract - Cited by 316 (17 self) - Add to MetaCart
We describe the design, prototyping and evaluation of ARC, a system for automatically compiling a list of authoritative web resources on any (sufficiently broad) topic. The goal of ARC is to compile resource lists similar to those provided by Yahoo! or Infoseek. The fundamental difference

Specification, Verification and Prototyping of an Optimized Compiler

by He Jifeng, Jonathan P. Bowen , 1994
"... This paper generalizes an algebraic method for the design of a correct compiler to tackle specification and verification of an optimized compiler. The main optimization issues of concern here include the use of existing contents of registers where possible and the identification of common expression ..."
Abstract - Cited by 13 (4 self) - Add to MetaCart
, acting as a correct compiling specification, are presented and an example proof within the refinement algebra of the programming language is given. Based on these theorems, a prototype compiler in Prolog is produced.

An Approach to Verifiable Compiling Specification and Prototyping

by Jonathan P. Bowen, He Jifeng, Paritosh K. Pandya - IN DIRECTORATE-GENERAL OF THE COMMISSION OF THE EUROPEAN COMMUNITIES (ED.): `ESPRIT '90 CONFERENCE PROCEEDINGS', BRUSSELS (KLUWER ACADEMIC PUBLISHERS B.V , 1990
"... A compiler may be specified as a set of theorems, each describing how a construct in the programming language is translated into a sequence of machine instructions. The machine may be specified as an interpreter written in the programming language itself. Using refinement algebra, it can then be ver ..."
Abstract - Cited by 15 (6 self) - Add to MetaCart
then be verified that interpreting a compiled program is the same or better than executing the original source program. The compiling specification is very similar to a logic program and thus a prototype compiler (and interpreter) may easily be produced in a language such as Prolog. A subset of the occam

Escape analysis for Java

by Jong-deok Choi, Mannish Gupta, Mauricio Serrano, Vugranam C. Sreedhar, Sam Midkiff - OOPSLA , 1999
"... This paper presents a simple and efficient data flow algorithm for escape analysis of objects in Java programs to determine (i) if an object can be allocated on the stack; (ii) if an object is accessed only by a single thread duriing its lifetime, so that synchronization operations on that object ca ..."
Abstract - Cited by 300 (12 self) - Add to MetaCart
be used effectively in different calling contexts. We present an interprocedural al-gorithm that uses the above property to efficiently compute the connection graph and identify the non-escaping objects for methods and threads. The experimental results, from a proto-type implementation of our framework

The PROMIS Compiler Prototype

by Carrie J. Brownhill, Alexandru Nicolau, Steve Novack, Constantine D. Polychronopoulos , 1997
"... Source code parallelizers and instruction level parallelizers each have specific advantages. Usually, a compiler is designed to be one or the other based on the target architecture and/or algorithms. A compiler that is designed to generate near-optimal code for modern, multi-level machines must have ..."
Abstract - Cited by 6 (1 self) - Add to MetaCart
have the capabilities of both. This paper describes the prototype of the PROMIS compiler. The prototype was designed to show that loop level and instruction level parallelization can be combined to produce results better than either one alone. In addition, it shows how communication between the levels

Generic Compiler Prototyping System

by Thilo Ernst
"... This paper describes the TRAP compiler generator. The object-oriented, dynamic language Python plays a central role in TRAP: As a very high level language it contributes built-in polymorphic collection and mapping data types, a exible object model, automatic memory management and more features meani ..."
Abstract - Add to MetaCart
This paper describes the TRAP compiler generator. The object-oriented, dynamic language Python plays a central role in TRAP: As a very high level language it contributes built-in polymorphic collection and mapping data types, a exible object model, automatic memory management and more features
Results 1 - 10 of 1,550