This directory is created automatically and some papers may be mislabeled. Only document within the CiteSeer database are listed. The directory is intended to provide entry points for browsing the database and is not intended to be authoritative. Papers may not appear in all relevant categories. For example, papers in a sub-category may not appear in higher level categories.
Applying Optimization Principle Patterns to Real-time ORBs - Irfan Pyarali Carlos (2000)(Correct)
First-generation CORBA middleware was reasonably successful
at meeting the demands of request/response applications
with best-effort quality of service (QoS) requirements. Supporting
applications with... / Idl Skeleton Skeleton Idl Compiler Idl Compiler Figure Key br Idl Compiler Idl Compiler Figure Key Components In The
Extending Value Reuse to Basic Blocks with Compiler Support - Jian Huang Department (2000)(Correct)
Speculative execution and instruction reuse are two important strategies that have been investigated
for improving processor performance. Value prediction at the instruction level has been introduced ... / Value Reuse to Basic Blocks with Compiler Support Jian Huang br This study suggests that using compiler support to extend value reuse to
Type Reconstruction for Linear Pi-Calculus with I/O Subtyping - Igarashi, Kobayashi (2000)(Correct)
Powerful concurrency primitives in recent concurrent languages and thread libraries provide
great exibility about implementation of high-level features like concurrent objects.
However, they are so ... / and incorporated it into the compiler of the concurrent language br places where he or she wants a compiler to check channel usage.
Run-Time Support for Distributed Sharing in Typed Languages - Hu, Yu, Cox, Wallach, Zwaenepoel (2000)(Correct)
This paper addresses run-time support for sharing objects in a typed language between the different computers within a cluster. Typing must be strong enough that it is possible to determine unambiguou... / different protection attributes. Compiler optimization reduces the overhead br are largely overlapped. Compiler Optimizations The extra
Query Optimization in Kess - An Ontology-Based KBMS - Andrade, Saltz (2000)(Correct)
This paper presents an approach for the implementation of query optimization techniques in Kess
(the Knowledge Enhanced SQL Server). Kess is a Knowledge Database Management Systems (KBMS)
that uses a ... / related. These techniques use a compiler optimizationapproach to simplify br different because we make use of a compiler optimization approach and
Automatic Memory Layout Transformations to Optimize Spatial Locality.. - Clauss, Meister (2000)(Correct)
One of the most efficient ways to improve program performances onto nowadays computers is to optimize the way cache memories are used. In particular, many scientic applications contain loop nests that... / evaluation function to the compiler such that the data layout br optimization optimizing compiler parameterized polyhedron
Register Allocation for Common Subexpressions in DSP Data Paths - Leupers (2000)(Correct)
This paper presents a new code optimization
technique for DSPs with irregular data
path structures. We consider the problem of generating
machine code for data ow graphs with common
subexpressions (... / is no adequate tool support by C compilers. Since DSPs are tuned for br architectures pose problems for C compilers since special constraints on
Application of Reconfigurable CORDIC Architectures - Mencer, Semeria, Morf, Delosme (2000)(Correct)
Very high performance architectures can be designed for
data intensive and latency tolerant applications by maximizing
the parallelism and pipelining at the algorithm and
bit level. This is achieved b... / synthesis we use Synopsys Design Compiler to synthesize the circuit and br circuit and Synopsys Behavioral Compiler for the arithmetic
Nonlinear Array Layouts for Hierarchical Memory Systems - Chatterjee, Jain, Lebeck, Mundhra.. (1999)(Correct)
Programming languages that provide multidimensional arrays and
a flat linear model of memory must implement a mapping between
these two domains to order array elements in memory. This layout
function ... / in several high-performance compilers. Tiling techniques are also br by the programmer or by the compiler and examine the additional
Quantifying Loop Nest Locality Using SPEC'95 and the Perfect.. - McKinley, Temam (1999)(Correct)
This paper analyzes and quantifies the locality characteristics of numerical loop nests in order to suggest future
directions for architecture and software cache optimizations. Since most programs spe... / and provide new insights for the compiler writer and the architect. br cache memories Smi Smi and compiler techniques that exploit cache
Phase-Coupled Mapping of Data Flow Graphs to Irregular Data Paths - Bashford, Leupers (1999)(Correct)
Many software compilers for embedded processors produce machine code of insufficient
quality. Since for most applications software must meet tight code speed and size constraints,
embedded software ... / .Abstract. Many software compilers for embedded processors produce br the use of high-level language compilers also for embedded software new
Typed Memory Management in a Calculus of Capabilities - Crary, Walker, Morrisett (1999)(Correct)
An increasing number of systems rely on programming language
technology to ensure safety and security of low-level
code. Unfortunately, these systems typically rely on a complex,
trusted garbage colle... / type-safe code. We present a compiler intermediate language called the br heavily optimized by hand or by compiler and yet be automatically
Trace Cache Design for Wide-Issue Superscalar Processors - Patel (1999)(Correct)
To maximize the performance of a wide-issue superscalar processor, the fetch mechanism must be capable of delivering at least the same instruction bandwidth as the execution mechanism is capable of co... / . . . Compiler-based techniques . br . . Compiler Optimizations .
From Recursion to Iteration: What Are the Optimizations? - Liu, Stoller (1999)(Correct)
Transforming recursion into iteration eliminates the use of stack frames during program execution.
It has been studied extensively. This paper describes a general and powerful method,
based on increme... / Other languages consider this a compiler optimization. For example this br are more widely supported in compilers for generating ecient code.
Combining Compile-Time and Run-Time Support for Efficient Software.. - Sandhya Dwarkadas (1999)(Correct)
We describe an integrated compile-time and run-time
system for efficient shared memory parallel computing
on distributed memory machines. The combined system
presents the user with a shared memory pro... / and automatic data caching. The compiler improves the efficiency of the br underlying hardware. To do so the compiler analyzes shared memory accesses
Memory Forwarding: Enabling Aggressive Layout Optimizations by.. - Chi-Keung Luk (1999)(Correct)
By optimizing data layout at run-time, we can potentially enhance
the performance of caches by actively creating spatial locality,
facilitating prefetching, and avoiding cache conflicts and
false shar... / is well beyond the scope of the compiler for languagessuch as C. To br Either the programmer or the compiler must prove that relocating the
Type Directed Specialization of Polymorphism - Atsushi Ohori (1999)(Correct)
Flexibility of programming and efficiency of program execution are two important features
of a programming language. Unfortunately, however, these two features conflict each other in
design and implem... / performed by most of optimizing compilers. Since the data structure is br is statically determined the compiler can compile high-level generic
Static Correlated Branch Prediction - Young, Smith (1999)(Correct)
this article, we show how to instrument a program so that it is practical to collect run-time statistics that indicate where branch correlation occurs, and we then show how to use these statistics to ... / Languages Processors compilers optimization General Terms br In both the architecture and compiler domains conditional branch
Hardware Compilation: Verification and Rapid-prototyping - Bowen, He (1999)(Correct)
The use of Field Programmable Gate Arrays (FPGA) to rapidly produce custom hardware circuits using a completely software-based process is becoming increasingly widespread. Specialized Hardware Descrip... / in the design of an automatic compiler. In this way we hope to br very method of construction the compiler is correct. The hardware normal
Load-Reuse Analysis: Design and Evaluation - Bodik, Gupta, Soffa (1999)(Correct)
Load-reuse analysis finds instructions that repeatedly access the
same memory location. This location can be promoted to a register,
eliminating redundant loads by reusing the results of prior memory
... / recent memory accesses. How can compilers benefit from these reuse br Georgia May - . compiler promotes repeatedly accessed
Scheduling Unrelated Machines by Randomized Rounding - Schulz, Skutella (1999)(Correct)
In this paper, we provide a new class of randomized approximation algorithms for parallel machine scheduling
problems. The most general model we consider is scheduling unrelated machines with release ... / new applications for instance in compiler optimization or in parallel br for instance in compiler optimization or in parallel computing
Locality Optimizations for Multi-Level Caches - Rivera, Tseng (1999)(Correct)
Compiler transformations can significantly improve data
locality of scientific programs. In this paper, we examine
the impact of multi-level caches on data locality optimizations.
We find nearly all t... / Park MD Abstract Compiler transformations can significantly br Our results indicate existing compiler optimizations are usually
Clustered Speculative Multithreaded Processors - Marcuello, González (1999)(Correct)
In this paper we present a processor microarchitecture that can simultaneously execute multiple
threads and has a clustered design for scalability purposes. A main feature of the proposed
microarchite... / compiled with the DEC Alpha compiler with full optimization have a br runtime mechanisms without any compiler support b data speculation
Dynamic Query-Based Debugging - Lencevicius, Hölzle, Singh (1999)(Correct)
Program errors are hard to find because of the cause-effect gap between the time when an error occurs and
the time when the error becomes apparent to the programmer. Although debugging techniques su... / example consider the javac Java compiler a part of Sun's JDK br During a compilation this compiler builds an abstract syntax tree
MultiView and Millipage - Fine-Grain Sharing in Page-Based DSMs - Itzkovitz, Schuster (1999)(Correct)
In this paper we develop a novel technique, called MultiView,
which enables implementation of page-based
fine-grain dsms. We show how the traditional techniques
for implementing page-based dsms can be... / system api and requires no compiler intervention page twinning br require a specially tailored compiler or binary code instrumentation
Calculation Carrying Programs - Hu, Takeichi (1999)(Correct)
this paper, we propose a new mechanism called calculation carrying
programs that can relax the tension between efficiency and clarity
in programming. The idea is to accompany clear programs with some
... / be executed automatically by our compiler to derive efficient programs. As br One may hope that a language compiler could automatically improve the
The Jalapeño Dynamic Optimizing Compiler for Java - Burke, Choi, Fink, Grove, Hind.. (1999)(Correct)
The Jalape~no Dynamic Optimizing Compiler is a key component of the Jalape~no Virtual Machine, a new Java 1 Virtual Machine (JVM) designed to support efficient and scalable execution of Java applicati... / The Jalape no Dynamic Optimizing Compiler for Java TM Michael G. br The Jalape no Dynamic Optimizing Compiler is a key component of the
Efficient Incremental Run-Time Specialization for Free - Marlet, Consel, Boinot (1999)(Correct)
Availability of data in a program determines computation
stages. Incremental partial evaluation exploit
these stages for optimization: it allows further specialization
to be performed as data become a... / its data and the generation of a compiler generator capable of br is generally obtained using a compiler generator cogen given a
Localizing Non-affine Array References - Mitchell, Carter, Ferrante (1999)(Correct)
Existing techniques can enhance the locality of arrays
indexed by affine functions of induction variables. This paper
presents a technique to localize non-affine array references,
such as the indirect... / Despite the efforts of the vendor compiler to mask latencies the load br CA July . A. J. C. Bik. Compiler Support for Sparse Matrix
Mechanized Operational Semantics via (Co)Induction - Simon J. Ambler, Roy L. Crole (1999)(Correct)
We give a fully automated description of a small programming language in the
theorem prover Isabelle-98. The language syntax and semantics are encoded, and
we formally verify a range of semantic prope... / techniques and for verifying compiler optimization steps. Contextual br and for verifying compiler optimization steps. Contextual equivalence
Value Profiling and Optimization - Calder, Feller, al. (1999)(Correct)
Variables and instructions that have invariant or predictable values at run-time, but
cannot be identified as such using compiler analysis, can benefit from value-based compiler
optimizations. Value-b... / cannot be identified as such using compiler analysis can benefit from br can benefit from value-based compiler optimizations. Value-based
Domain-Specific Languages: from Design to Implementation Application.. - Thibault, Marlet, Consel (1999)(Correct)
Domain-specific languages (DSL) have many potential
advantages in terms of software engineering ranging from
increased productivity to the application of formal methods.
Although they have been used i... / Approaches that are based on compilers such as application generators br and extensions require skills in compiler technology that cannot be
Research summary for dynamic detection of program invariants - Ernst (1999)(Correct)
s to automatically infer invariants.
In this research, we focus on the dynamic discovery of invariants:
we execute a program on a collection of inputs
and extract variable values from which we then in... / or assert statements. Compilers can exploit invariants by br work includes the Illustrating Compiler which heuristically detects the
A Comparison of Compiler Tiling Algorithms - Rivera, Tseng (1999)(Correct)
Linear algebra codes contain data locality which can be exploited
by tiling multiple loop nests. Several approaches to tiling have
been suggested for avoiding conflict misses in low associativity ca... / A Comparison of Compiler Tiling Algorithms Gabriel br intra-variable padding a compiler optimization for eliminating
Flexible Type Analysis - Crary, Weirich (1999)(Correct)
Run-time type dispatch enables a variety of advanced
optimization techniques for polymorphic languages, including
tag-free garbage collection, unboxed function
arguments, and flattened data structures... / However modern type-preserving compilers transform types between stages br Introduction Type-directed compilers use type information to enable
An Optimizing Compiler for Efficient Model Checking - Yifei Dong (1999)(Correct)
Different model checking tools offer a variety of specification languages to encode
systems. These specifications are compiled into an intermediate form from which the
global automata are derived at v... / An Optimizing Compiler for Efficient Model Checking br in practice. For example the compiler reduces the verification time of
Towards Automatic Specialization of Java Programs - Schultz, Lawall, Consel, Muller (1999)(Correct)
Automatic program specialization can derive efficient implementations from
generic components, thus reconciling the often opposing goals of genericity and efficiency.
This technique has proved usefu... / for C programs and a Java-to-C compiler. Specialization is managed using br the Harissa optimizing Java-to-C compiler In this paper we
Declarative Program Transformation: a Deforestation case-study - Correnson, Duris, Parigot, Roussel (1999)(Correct)
Software engineering has to reconcile modularity with efficiency.
One way to grapple with this dilemma is to automatically transform
a modular-specified program into an efficient-implementable one.
... / was for a long time compiler optimization. More recently with br tool for applicative and modular compiler specifications. Forschungsbericht
Condition Awareness Support For Predicate Analysis And Optimization - Sias (1999)(Correct)
CONTENTS
Page
1. INTRODUCTION . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.1 Organization of this Work . . . . . . . . . . . . . . . .... / invested in the IMPACT Research Compiler by many previous generations of br EPIC architectures permit the compiler to express instruction-level
A New, Simpler Linear-Time Dominators Algorithm - Buchsbaum, Kaplan, Rogers, Westbrook (1999)(Correct)
this article is organized as follows. Section 2 outlines Lengauer and
Tarjan's approach. Section 3 gives a broad overview of our algorithm and differentiates
it from previous work. Section 4 presents ... / Languages Processors-compilers E. Data Structures br Additional Key Words and Phrases Compilers dominators flowgraphs
Escape Analysis for Object Oriented Languages. Application to Java - Blanchet (1999)(Correct)
Escape analysis [27, 14, 5] is a static analysis that determines
whether the lifetime of data exceeds its static scope.
The main originality of our escape analysis is that it determines
precisely the... / on the Caml Special Light compiler an implementation of ML with br It is based on TurboJ a Java to C compiler designed by the Silicomp
Rule-Based Query Optimization, Revisited - Lane Warshaw (1999)(Correct)
We present the architecture and a performance assessment of an extensible query optimizer written in Venus. Venus is a
general-purpose active-database rule language embedded in C++. Following the deve... / OPTand Venus. Venus' optimizing compiler yields code whose performance is br include An optimizing compiler that yields fast execution speed.
Predicated Static Single Assignment - Carter, Simon, Calder, Carter.. (1999)(Correct)
Increases in instruction level parallelism are needed to
exploit the potential parallelism available in future wide issue
architectures. Predicated execution is an architectural
mechanism that increas... / the correct path. In order for the compiler to expose such parallelism br such parallelism traditional compiler data-flow analysis needs to be
Selecting Tile Shape for Minimal Execution Time - Karin Hogstedt (1999)(Correct)
Many computationally-intensive programs, such as those for
differential equations, spatial interpolation, and dynamic programming,
spend a large portion of their execution time in
multiply-nested loop... / This formula can be used by a compiler to predict the execution time of br the execution time of a tile a compiler can use this formula to predict
Automatic Compiler-Inserted Prefetching for Pointer-Based Applications - Chi-Keung Luk (1999)(Correct)
As the disparity between processor and memory
speeds continues to grow, memory latency is becoming
an increasingly important performance bottleneck. While
software-controlled prefetching is an attract... / NO. FEBRUARY Automatic Compiler-Inserted Prefetching for br we expand the scope of automatic compiler-inserted prefetching to also
CROPS: Coordinated Restructuring Of Programs and Storage - Carter, Ferrante, Högstedt.. (1999)(Correct)
references; coordination of storage mapping and
tiling; and guidance and tradeoffs for parallel execution.
1 Non-affine Array References
Background: Researchers have long sought to increase
data loc... / Despite the efforts of the vendor compiler and advanced architectures to br we are given a parallelizing compiler would use greater or fewer
Multithreaded Dependence Graphs for Concurrent Java Programs - Zhao (1999)(Correct)
Understanding program dependencies in a computer program is essential for many software engineering activities including program slicing, testing, debugging, reverse engineering, and maintenance. In t... / data flows in the program. Many compiler optimizations and program br although originally proposed for compiler optimizations has been used for
Dependent Types in Practical Programming (Extended Abstract) - Xi, Pfenning (1999)(Correct)
Hongwei Xi
Department of Computer Science and Engineering
Oregon Graduate Institute of Science and Technology
hongwei@cse.ogi.edu
Frank Pfenning
Department of Computer Science
Carnegie Mellon Univ... / program error detection and compiler optimization. A major br be expressed and thus checked by a compiler. For instance the error of
SUIF Explorer: an interactive and interprocedural parallelizer - Liao, Diwan, Bosch, Ghuloum, Lam (1999)(Correct)
The SUIF Explorer is an interactive parallelization tool that
is more effective than previous systems in minimizing the
number of lines of code that require programmer
assistance. First, the interproc... / form of explicit directives to the compiler to perform or ignore some br to perform or ignore some compiler analysis or optimization
An Empirical Study of Function Pointers Using SPEC Benchmarks - Ben-Chung Cheng Wen-Mei (1999)(Correct)
Since the C language imposes little restriction on the use of function pointers, the
task of call graph construction for a C program is far more difficult than what the
algorithms designed for Fortran... / call graph extractor in the IMPACT compiler we found the call graph br analysis framework in the IMPACT compiler From the point of view
Safe and Principled Language Interoperation - Trifonov, Shao (1999)(Correct)
Safety of interoperation of program fragments written in different safe
languages may fail when the languages have different systems of computational
effects: an exception raised by an ML function m... / source languages allows the compiler to optimize interlanguage calls br as an intermediate language for optimization of resource handling.
Self-Monitoring in VINO - Saleeb (1999)(Correct)
Computer system performance is a measure of how well the operating system shares hardware
and software resources among the various applications that are running on it. The goal of
performance monitori... / by a cooperation between the compiler and operating system. It also br Morph provides a framework for compiler optimizations and is only
ILP versus TLP on SMT - Mitchell, Carter, Ferrante, Tullsen (1999)(Correct)
Abstract By sharing processor resources among threads at a very fine granularity, a simultaneous multithreading processor (SMT) renders thread-level parallelism (TLP) and instruction-level parallelism... / we are given a parallelizing compiler would use greater or fewer br most out of SMT a programmer or compiler needs to predict which of the
The Program Decision Logic Approach to Predicated Execution - August, Sias, Puiatti, Mahlke.. (1999)(Correct)
Modern compilers must expose sufficient amounts of
Instruction-Level Parallelism (ILP) to achieve the promised
performance increases of superscalar and VLIW processors.
One of the major impediments to... / Abstract Modern compilers must expose sufficient amounts br control flow. Historically the compiler has translated the programmer's
BPF+: Exploiting Global Data-flow Optimization in a Generalized.. - Begel, McCanne, Graham (1999)(Correct)
A packet filter is a programmable selection criterion for classifying
or selecting packets from a packet stream in a generic, reusable
fashion. Previous work on packet filters falls roughly into two c... / The optimization phase of the compiler uses a flowgraph set relation br high-level language and a compiler generates the actual low-level
FASTEST: A Practical Low-Complexity Algorithm for Compile-Time.. - Kwok, Ahmad (1999)(Correct)
In the area of parallelizing compilers considerable research has been carried out on data
dependency analysis, parallelism extraction, as well as program and data partitioning. However,
designing a pr... / In the area of parallelizing compilers considerable research has been br be incorporated in a parallelizing compiler. In this regard Yang and
Techniques for Optimizing CORBA Middleware for Distributed Embedded.. - Gokhale, Schmidt (1999)(Correct)
The distributed embedded systems industry is poised to leverage
emerging real-time operating systems, such as Inferno, Windows CE,
EPOC, and Palm OS to support mobile communication applications, such
... / The Protocol Engine And Corba Idl Compiler Provided By Tao Which Is Our br CORBA implementation. TAO's IDL compiler produces stubs that can use
Link-time Improvement of Scheme Programs - Saumya Debray (1999)(Correct)
Optimizing compilers typically limit the scope of their analyses
and optimizations to individual modules. This has two drawbacks:
first, library code cannot be optimized together with their callers,... / Abstract. Optimizing compilers typically limit the scope of br two different optimizing Scheme compilers and several benchmark
Fine-Grained Dynamic Instrumentation of Commodity Operating System.. - Tamches, Miller (1999)(Correct)
We have developed a technology, fine-grained
dynamic instrumentation of commodity kernels, which
can splice (insert) dynamically generated code before
almost any machine code instruction of a complete... / machine code is that the effect of compiler optimizations which can reorder br source code line needs the compiler's debugging line number
Efficient Global Register Allocation for Minimizing Energy Consumption - Zhang, Hu, Chen (1999)(Correct)
Data referencing during program execution can be a signi cant source of energy consumption
especially for data-intensive programs. In this paper, we propose an approach to minimize
such energy consump... / components is usually done by a compiler. Many factors can aect the br register allocator in the Tiger compiler presented in The modularity
Soot - a Java Bytecode Optimization Framework - Vallee-Rai, Co, Gagnon, Hendren.. (1999)(Correct)
This paper presents Soot, a framework for optimizing
Java
bytecode. The framework is implemented
in Java and supports three intermediate representations
for representing Java bytecode: Baf,
a stre... / up to when run using the JIT compiler. Introduction Java br are required. Using a Just-InTime compiler or a Way-Ahead-Of-Time Java
Exploiting Domain-Specific Properties: Compiling Parallel Dynamic.. - Prechelt (1999)(Correct)
Domain-specific constraints can be exploited to implement compiler optimizations
that are not otherwise feasible: Compilers for neural network learning algorithms
can achieve near-optimal co-locality ... / can be exploited to implement compiler optimizations that are not br that are not otherwise feasible Compilers for neural network learning
Construction of the Adjoint MIT Ocean General Circulation Model and.. - Marotzke (1999)(Correct)
We first describe the principles and practical considerations behind the computergeneration
of the adjoint to the MIT ocean general circulation model (GCM), using R.
Giering's software tool Tangent-li... / Tangent-linear and Adjoint Model Compiler TAMC The TAMC's recipe for br Tangent-linear and Adjoint Model Compiler TAMC Giering Giering
TALx86: A Realistic Typed Assembly Language - Morrisett, Crary, Glew, Grossman.. (1999)(Correct)
In previous work, we presented a formalism for a statically
typed, idealized assembly language called TAL.
The goal of TAL was to provide an extremely lowlevel,
statically-typed target language that i... / in practice just-in-time JIT compilers are used to achieve acceptable br verification an error in the compiler can introduce a security hole.
Return Value Placement And Tail Call Optimization In High Level.. - Bigot, Debray (1999)(Correct)
Machine [21], is to pass the ith argument in
register i: if the ith argument happens to be a variable (which typically corresponds
to an output argument), the value passed is a pointer to the location... / the S- Common Lisp compiler uses this approach for numerical br desirable is a method whereby a compiler can determine for each procedure
Low Energy Register Allocation Beyond Basic Blocks - Zhang, Hu, Chen (1999)(Correct)
An approach of doing register allocation beyond basic blocks for low energy is presented
in this paper. With careful analysis of boundary conditions between consecutive blocks, our
approach achieves t... / components is usually done by a compiler. Many factors can aect the br A.W. Appel Modern Compiler Implementation in C Cambridge
Comprehensive Hardware and Software Support for Operating Systems to.. - Chun Xia (1999)(Correct)
High-performance multiprocessor workstations are becoming increasingly popular. Since
many of the workloads running on these machines are operating-system intensive, we are interested
in what sort of ... / runs of the second phase of the C compiler which generates assembly code br Code Layout Optimization by the Compiler The first support that we
Fast Compilation for Pipelined Reconfigurable Fabrics - Budiu, Goldstein (1999)(Correct)
In this paper we describe a compiler which quickly synthesizes
high quality pipelined datapaths for pipelined reconfigurable
devices. The compiler uses the same internal representation to
perform synt... / In this paper we describe a compiler which quickly synthesizes high br reconfigurable devices. The compiler uses the same internal
3D Exploration of Uniprocessor Schedules for DSP Algorithms - Teich, Zitzler, al. (1999)(Correct)
When implementing software for programmable digital signal processors (PDSPs),
the design space is defined by a complex range of constraints and optimization objectives.
Three implementation metrics t... / and Meyr today's DSP compilers still produce several s of br avoids the limitations of current compiler technology is to store optimized
Set Constraints for Destructive Array Update Optimization - Wand, Clinger (1999)(Correct)
Destructive array update optimization is critical for writing scientific
codes in functional languages. We present set constraints for an interprocedural
update optimization that runs in polynomial ti... / analysis operational semantics compiler correctness Introduction br flow analysis that is familiar to compiler writers ASU It does not
Dead Code Elimination through Dependent Types - Xi (1999)(Correct)
Pattern matching is an important feature in various functional
programming languages such as SML, Caml, Haskell, etc. In these
languages, unreachable or redundant matching clauses, which can be rega... / to the current version of SML NJ compiler an error message is reported br both program error detection and compiler optimization. For instance the
Compile-time Based Performance Prediction - Cascaval, DeRose, Padua, Reed (1999)(Correct)
In this paper we present results we obtained using a compiler
to predict performance of scienti c codes. The compiler, Polaris [3], is
both the primary tool for estimating the performance of a ran... / results we obtained using a compiler to predict performance of br of scienti c codes. The compiler Polaris is both the
Multidimensional Exploration of Software Implementations for DSP.. - Zitzler, Teich, al (1999)(Correct)
When implementing software for programmable digital signal processors
(PDSPs), the design space is defined by a complex range of constraints and
optimization objectives. Three implementation metrics... / group today's DSP compilers still produce several s of br avoids the limitations of current compiler technology is to store optimized
Multi-stage Cascaded Prediction - Driesen, Hölzle (1999)(Correct)
Two-level predictors deliver highly accurate conditional branch prediction, indirect
branch target prediction and value prediction. Accurate prediction enables speculative execution of
instructions,... / of choice for most Cand Java compilers execute an indirect branch for br each see Table and beta a compiler for the Beta programming
A semantics for imprecise exceptions - Jones, Reid, Hoare, Marlow, Henderson (1999)(Correct)
Some modern superscalar microprocessors provide only imprecise
exceptions. That is, they do not guarantee to report
the same exception that would be encountered by a
straightforward sequential execut... / crippling the language or its compilers. We do not yet have enough br of the programming language. The compiler or the programmer might want
Control CPR: A Branch Height Reduction Optimization for EPIC.. - Schlansker, Mahlke, Johnson (1999)(Correct)
The challenge of exploiting high degrees of instruction-level
parallelism is often hampered by frequent branching. Both exposed
branch latency and low branch throughput can restrict parallelism.
Cont... / To fully exploit EPIC processors compilers must also transform and br limits to achieved performance compiler researchers need to develop
Distributed Mediation using a Light-Weight OODBMS - Josifovski, Risch (1999)(Correct)
An overview is given of a light-weight, Object-Oriented (OO), multi-database
system, named AMOS II. Object-Oriented multi-database queries and views
can be defined where external data sources of diffe... / before execution. The query compiler translates AMOSQL statements br object algebra programs many optimizations are applied on AMOSQL
Array Language Support for Wavefront and Pipelined Computations - Chamberlain, Lewis, Snyder (1999)(Correct)
Array languages such as Fortran 90, High Performance Fortran and
ZPL are convenient vehicles for expressing data parallel computations. Unfortunately,
array language semantics prohibit the natural e... / to both the programmer and compiler. This paper describes and br are left to guess how the compiler will optimize their code. They
Improving the Performance of Speculatively Parallel Applications on.. - Olukotun, Hammond, Willey (1999)(Correct)
Hydra is a chip multiprocessor (CMP) with integrated support for thread-level speculation. Thread-level
speculation provides a way to parallelize sequential programs without the need for data dependen... / thread architecture the compiler must break the program into br to be parallel. Furthermore compilers and manual optimization can be
A Framework for Assessing Uncertainties in Simulation Predictions - Hanson (1999)(Correct)
A probabilistic framework is presented for assessing the uncertainties in simulation
predictions that arise from model parameters derived from uncertain measurements.
A probabilistic network facilitat... / has developed a useful compiler for forward codes written in br Tangent linear and Adjoint Model Compiler Technical Report TAMC .
A Case for Automatic Run-Time Code Optimization - Feigin (1999)(Correct)
This thesis describes the design of a software system capable of automatically performing
code optimizations at run-time. Rather than attempting to run all optimizations
statically, a compiler produce... / all optimizations statically a compiler produces an executable capable of br compile-time optimizer. Since the compiler already has the job of converting
Declarative Internet Programming Constraint-based Optimization of.. - Hickey (1999)(Correct)
no abstract-- unknown Declarative Internet Programming
Constraint-based Optimization of Scheme Applets
Timothy J. Hickey
,
February 16, 1999
1 Proposed research
This proposal addresses both theor... / by developing Just-in-Time compilers which can compile classfiles to br for use by optimizing compilers. An added advantage of the
Debugging of Optimized Code through Comparison Checking - Jaramillo, Gupta, Soffa (1999)(Correct)
We present a new approach to the debugging of optimized code through comparison checking. In this
scheme, both the unoptimized and optimized versions of an application execute, and values they compute... / in the optimized code. The compiler generates annotations for the br of COP. Lcc was used as the compiler for the application program and
Evolutionary Algorithm Based Exploration of Software Schedules for.. - Zitzler, Teich, al. (1999)(Correct)
The simultaneous exploration of tradeoffs between
program memory, data memory and execution
time requirements (3D) for DSP (digital
signal processing) algorithms in embedded
computing environments is... / et al. today's DSP compilers still produce several s of br avoids the limitations of current compiler technology is to store optimized
Efficient Power Estimation Techniques for HW/SW Systems - Marcello Lajolo (1999)(Correct)
We present a power estimation framework for hardware/software System-On-Chip (SOC) designs
based on concurrent and synchronized execution of a hardware simulator and an instruction set
simulator. Conc... / as power co-estimation Target compiler object files for target br potentially be mapped to HW. A compiler for the target processor is used
The Impact of Exploiting Instruction-Level Parallelism on.. - Vijay Pai (1999)(Correct)
Current microprocessors incorporate techniques
to aggressively exploit instruction-level parallelism
(ILP). This paper evaluates the impact of such processors
on the performance of shared-memory multi... / Protocol A More Aggressive Compiler the Better Of Sparc Sc . And br Since we did not have access to a compiler that schedules instructions for
A More Efficient RMI for Java - Nester, Philippsen, Haumacher (1999)(Correct)
In current Java implementations, Remote Method Invocation (RMI) is too slow, especially for high performance computing. RMI is designed for wide-area and high-latency networks, it is based on a slow o... / is currently working on the compiler project Manta Manta has br platforms or particular native compilers. There are other approaches to
Experiences with Query Translation: Object Queries meet DB2 - Cherniack, Malhotra, Zdonik (1999)(Correct)
COKO-KOLA is a two-tiered framework for building eÆcient and correct query rewriters. KOLA
is a combinator-based (i.e., variable-free) query algebra and representation that permits the expression
of b... / ciencies in the COKO language and compiler implementation that can be br right semi-joins on A. Our COKO compiler compiles these inference rules
Detecting and Exploiting Narrow Bitwidth Computations - Budiu, Goldstein (1999)(Correct)
Many important applications perform computations on non-standard bit-width values; mapping
them to word-based processing units is wasteful of resources and results in suboptimal
performance. While t... / advantage of varying bit-widths compiler optimizations lag far behind. We br lag far behind. We present a compiler algorithm which infers minimal
Integrating Data Mining with Relational DBMS: A Tightly-Coupled.. - And (1999)(Correct)
Data mining is rapidly finding its way into mainstream computing. The development of generic methods such as itemset counting has opened the area to academic inquiry and has resulted in a large harv... / Queries in SQL Query Flock Compiler Complex DM Query Query br understood methods for query optimization built into the DBMS can be
How to Pack Trees - Gil, Itai (1999)(Correct)
In a virtual memory system, the address space is partitioned into pages, and main
memory serves as a cache to the disk. In this setting, we address the following problem:
Given a tree, find an allocat... / of algorithms. from the compiler optimization and numerical br Aho R. Sethi and J. D. Ullman. Compilers principles techniques and
Hot Pages: Software Caching for Raw Microprocessors - Csaba Andras Moritz (1999)(Correct)
This paper describes Hot Pages, a software based solution for managing
on-chip data on the MIT Raw Machine, a scalable, parallel,
microprocessor architecture. This software system transparently
manage... / good performance by using a compiler to find instruction level and br is space-time orchestrated by the compiler. process of mapping a program
A New Framework for Debugging Globally Optimized Code - Wu, Mirani, Patil, Olsen, Hwu (1999)(Correct)
With an increasing number of executable binaries generated
by optimizing compilers today, providing a clear and correct
source-level debugger for programmers to debug optimized
code has become a neces... / binaries generated by optimizing compilers today providing a clear and br has been prototyped in the IMPACT compiler and GDB- . . Preliminary
JavaSet - extending Java by persistent sets - Schordan, Kosch, Böszörményi (1999)(Correct)
We introduce an extension of the programming language Java (called JavaSet) by
polymorph sets of objects, which can be both transient or persistent. JavaSet provides
transparent persistence, i.e. the ... / of the language. In section the compiler and its strong cooperation with br is translated by the compiler to a processing tree The
Execution Characteristics of Just-In-Time Compilers - Radhakrishnan, Rubio, John.. (1999)(Correct)
Just-In-Time (JIT) compilers interact with the Java Virtual Machine (JVM) at run time and compile appropriate bytecode sequences into native machine code. Loading and compilation time penalties are in... / Characteristics of Just-In-Time Compilers Technical Report - br Abstract Just-In-Time JIT compilers interact with the Java Virtual
DeHiFo - An Advanced HPF Debugging System - Brezany, Grabner, Sowa, Wismüller (1999)(Correct)
Debuggers are critical tools for the software development.
The design and implementation of a source-level debugging system that
enables the HPF programmer to observe the behavior of the program
... / Fund. processed by an HPF compiler which distributes program's data br the program parallelized by the compiler works. Program optimizations
Constraint Driven Code Selection for Fixed-Point DSPs - Bashford, Leupers (1999)(Correct)
Fixed-point DSPs are a class of embedded processors
with highly irregular architectures. This irregularity
makes it difficult to generate high-quality machine
code from programming languages such as C... / the use of high-level language compilers for embedded software br software development since compilers usually cause an overhead in
New shape analysis techniques for automatic parallelization of C codes - Corbera Asenjo (1999)(Correct)
Automatic parallelization of codes with complex data structures
is becoming very important. These complex, and often,
recursive data structures are widely used in scientific
computing. Shape analysis ... / have been implemented in a compiler which has been validated for br we present the results the compiler achieves for the C sparse LU
Text Classification by Bootstrapping with Keywords, EM and Shrinkage - McCallum, Nigam (1999)(Correct)
When applying text classi cation to complex tasks, it is tedious and expensive to hand-label the large amounts of training data necessary for good performance. This paper presents an alternative appro... / language NLP processing Compiler Design compiler Garbage br processing Compiler Design compiler Garbage garbage collection
ARMCI: A Portable Remote Memory Copy Library for Distributed Array.. - Nieplocha, Carpenter (1999)(Correct)
This paper introduces a new portable communication library
called ARMCI. ARMCI provides one-sided communication capabilities
for distributed array libraries and compiler run-time systems. It support... / Distributed Array Libraries and Compiler Run-time Systems Jarek br distributed array libraries and compiler run-time systems. It supports
EXPRESSION: A Language for Architecture Exploration through.. - Halambi, Grun, Ganesh, Khare, Dutt.. (1999)(Correct)
We describe EXPRESSION, a language supporting architectural
design space exploration for embedded Systems-onChip
(SOC) and automatic generation of a retargetable compiler
/simulator toolkit. Key featu... / Architecture Exploration through Compiler Simulator Retargetability. br generation of a retargetable compiler simulator toolkit. Key features
Constant Propagation Through Array Variables - Wonnacott (1999)(Correct)
Constant propagation can provide signi cant improvements in program
speed, both by directly enabling optimizations such as constant
folding and algebraic simpli cation and by providing information tha... / between loop iterations the compiler can privatize the variables give br to be examined. In contrast the compiler may not be able to place an
Harissa: A Hybrid Approach to Java Execution - Muller, Schultz (1999)(Correct)
Java provides portability and safety but falls short on efficiency. To
resolve this problem, the authors developed Harissa, an execution environment
that offers efficiency without sacrificing portabil... / JIT and offline byte code compilers. JIT systems compile byte code br is unacceptable. Typical offline compilers compile code before the program
Dynamic Circuit Generation for Boolean Satisfiability in an.. - Mencer, Platzner (1999)(Correct)
We apply our object-oriented design environment
PAM-Blox to dynamic generation of circuits for reconfigurable
computing. Our approach combines the
structural hardware design environment with commercia... / design run executable Ccompiler design in Ca overall design br commercial FSM synthesis and optimization. As driving application we
Hardware/Software Architectures for Real-Time Caching - Jacob (1999)(Correct)
Introduction
Real-time embedded systems require guaranteed performance behavior because they interact with the real world.
Today's embedded microprocessors are yesterday's high-performance desktop pr... / or application profiling or compiler optimization it is possible to br at CASES' Workshop on Compiler and Architecture Support for
A C Compiler for a Processor With a Reconfigurable Functional Unit - Ye (1999)(Correct)
With the flexibility of the FPGA, reconfigurable systems are able to get significant
speedups for some applications. Several architectures have been proposed to integrate a
processor with an FPGA in t... / A C Compiler for a Processor With a br RFU This thesis describes a C compiler for Chimaera which is a
Scheduling Straight-Line Code Using Reinforcement Learning and.. - Amy Mcgovern (1999)(Correct)
The execution order of a block of computer instructions can make a difference
in its running time by a factor of two or more. In order to achieve the
best possible speed, compilers use heuristic sched... / achieve the best possible speed compilers use heuristic schedulers br using the commercial Digital compiler at the highest level of
Optimizing Model Checking Based on BDD Characterization - Yang (1999)(Correct)
Symbolic model checking has been successfully applied in verification of various finite state systems, ranging
from hardware circuits to software protocols. A core technology underlying this success i... / research on the Fx parallelizing compiler. I thank Yirng-An for starting br my transition from parallelizing compiler to BDDs. I thank Claudson and
Set Associative Cache Behavior Optimization - Doallo, Fraguela, Zapata (1999)(Correct)
One of the most important issues related to program performance
is the memory hierarchy behavior. Programmers try nowadays
to optimize this behavior intuitively or using costly techniques such as
tr... / times can be integrated in a compiler or an optimizing environment. br that can be integrated in a compiler or optimizing environment. It is
Class-Invariant Binary Relations in Java - Webber (1999)(Correct)
In this paper we introduce a new method for automatically identifying class invariants
in object-oriented programs. We de ne a category of class-invariant relations for Java
programs and give a stat... / for Java programs unless the compiler can eliminate them using static br static analysis. The standard compiler technique for optimizing such
Performance Guidance Despite Optimization Interaction - Strout (1999)(Correct)
Improved application performance allows for computational analysis of bigger problems, saves money spent on computation resources, and handles more demanding multimedia applications. Having the compil... / applications. Having the compiler make all performance guidance br the program's purpose. However compilers do not suOEciently handle the
Type checking meta programs - Bjørner (1999)(Correct)
We report on preliminary experiments with inferring types for meta programs: programs that manipulate
programs. For this purpose we provide a two-level type system in a fragment of a higher-order
sy... / directly. The compiler requires types to be fully br freeze which causes the compiler to replace a pattern Var
A Linker for Effective Whole-program Optimizations - Cilio, Corporaal (1999)(Correct)
The use of a standard binary format in the later part of code generation
promotes efficiency and interchangeability of tools, but leaves little information
on the source file in the machine code rep... / by a modern architecture a compiler must apply all known br section offset assignment. The compiler back-end maps SUIF instructions
A Computer System for Model Helicopter Flight Control - Sanvido (1999)(Correct)
This technical memo describes the software core of Olga unknown Departement Informatik
Institut fur Computersysteme
Marco A.A. Sanvido
A Computer System for
Model Helicopter
Flight Control
Technical ... / with the Oberon for StrongARM compiler described in memo nr. br the use of the new features of the compiler we were able to implement the
Performance Evaluation and Benchmarking of Native Signal Processing - Deependra Talla (1999)(Correct)
DSP processor growth is phenomenal and continues to grow rapidly,
but general-purpose microprocessors have entered the multimedia and signal
processing oriented stream by adding DSP functionality to... / Cversion . and Intel C Ccompiler for the Pentium II processor and br Pentium II processor and the C xx compiler for the C processor. Maximum
Initialization Problems for Java - Börger, Schulte (1999)(Correct)
We exhibit a grey area in the specification
of Java and of its implementation through the Java Virtual
Machine (JVM): the treatment of initialization of
classes and interfaces. We report the result ... / and that various current Java compilers violate the initialization br -Java -Virtual machine -Compiler The Initialization Problem
Efficiency Issues for Ray Tracing - Brian Smits (1999)(Correct)
Ray casting is the bottleneck of many rendering algorithms. Although much
work has been done on making ray casting more efficient, most published work
is high level. This paper discusses efficiency ... / the code faster and which ones the compiler was already doing for you. br was already doing for you. Compilers are good at rearranging nearby
A Transformational Approach to Binary Translation of Delayed Branches - Ramsey, Cifuentes (1999)(Correct)
The fundamental steps in binary translation are distinguishing code from data,
mapping data from source to target, and translating instructions. Translating instructions
presents few problems, except ... / features not present in typical compiler intermediate codes. The most br draw from standard techniques in compiler optimization Aho Sethi and
clp(FD,S) User's and Reference Manual - Georget (1999)(Correct)
Contents
1 Introduction 3
2 The distribution 3
3 How to use clp(FD,S) ? 4
4 About the semiring used by SFD 4
5 Basic notions about the solver 4
5.1 FD variables . . . . . . . . . . . . . . . . . . .... / provides ffl a clp compiler clp fds which is named wamcc br bmf clp fd in ffl a C compiler wam gcc which is named w gcc
Comparing the Scalability of the Cray T3E-600 and the Cray Origin.. - Luecke, Raffin, Coyle (1999)(Correct)
This paper presents relative scalability results for the Cray T3E-600 and the Cray
Origin 2000 on ve communication tests for a variety of message sizes and for 4, 8, 12,
..., 128 processors. The v... / MIPSpro version . . . m Fortran compiler with the- - compiler options br Fortran compiler with the- - compiler options and sma library version
Shared Memory Implementations of Synchronous Dataflow Specifications.. - Murthy, Bhattacharyya (1999)(Correct)
There has been a proliferation of block-diagram environments for specifying and prototyping DSP systems.
These include tools from academia like Ptolemy [6], and commercial tools like SPW from Cadence
... / can then be used by a behavioral compiler to generate an RTL description of br into hardware using design compilers and layout tools. High-level
MultiView and Millipage Fine-Grain Sharing in Page-Based DSMs - Ayal Itzkovitz (1999)(Correct)
In this paper we develop a novel technique, called MultiView,
which enables implementation of page-based
#ne-grain dsms. We show how the traditional techniques
for implementing page-based dsms can be ... / system api and requires no compiler intervention page twinning br require a specially tailored compiler or binary code instrumentation
Exploiting Conditional Instructions in Code Generation for Embedded.. - Leupers (1999)(Correct)
This paper presents a new code optimization
technique for a class of embedded processors. Modern
embedded processor architectures show deep instruction
pipelines and highly parallel VLIW-like instruct... / code quality of current DSP compilers which still makes br ITE statements. Classical compiler technology uses conditional jumps
The implementation technology of the Mercury debugger - Somogyi, Henderson (1999)(Correct)
Every programming language needs a debugger. Mercury now
has three debuggers: a simple procedural debugger similar to the tracing
systems of Prolog implementations, a prototype declarative debugge... / be caught and pinpointed by the compiler. As a result most bugs in a br is produced. Of course the compiler cannot catch all errors some
Operational Equivalence of CHR Programs And Constraints - Abdennadher, Frühwirth (1999)(Correct)
A fundamental question in programming language semantics
is when two programs should be considered equivalent. In this paper we
introduce a notion of operational equivalence for CHR programs and
use... / and forward chaining suspension compiler optimization debugging can be br chaining suspension compiler optimization debugging can be implemented
DEFACTO: A Design Environment for Adaptive Computing Technology - Bondalapati, Diniz, Duncan.. (1999)(Correct)
The lack of high-level design tools hampers the widespread
adoption of adaptive computing systems. Application developers have to
master a wide range of functions, from the high-level architecture d... / bringing together parallelizing compiler technology and synthesis br DEFACTO leverages parallelizing compiler technology based on the Stanford
Global Program Optimization: Register Allocation of Static Scalar.. - Cilio, Corporaal (1999)(Correct)
Performing certain optimizations on whole programs
offers huge potential for code improvement.
To exploit this possibility, we implemented a framework
that allows sophisticated analysis and transforma... / Keywords Program optimization Compiler technology SUIF Linkage br During the translation of the compiler's intermediate format into
The Stratego Tutorial - Visser (1999)(Correct)
Stratego is a language for the speci cation of transformation rules
and strategies for applying them. Speci cations consist of a collection of modules
that de ne the signature of the object language(s... / rules and strategies. The Stratego compiler translates speci -cations to C br . . Getting the Compiler .
An Attribute Grammar Based Framework For Machine-Dependent.. - Cheung, McCanne (1999)(Correct)
Media processing algorithms are typically computationally
intensive, and in complexity constrained environments,
finding the most computationally efficient algorithm is critical.
In this paper, we pre... / algorithms means that traditional compiler-level code optimizations may not br Machine-Dependent Computational Optimization Of Media Processing Algorithms
Techniques for Obtaining High Performance in Java Programs - Iffat Kazi Howard (1999)(Correct)
This survey describes research directions in techniques to improve the performance of programs written
in the Java programming language. The standard technique for Java execution is interpretation,
wh... / Various types of Java compilers have been proposed including br including Just-In-Time JIT compilers that compile bytecodes into
Parallel and Distributed Implementation of Large Industrial.. - Luksch (1999)(Correct)
Parallelization of high performance computing applications has been a field of active research
for quite some time now. Most projects that have parallelized industrial software
packages have focused o... / to the OO code and advances in compiler technology will make the br to the fact that FOR- TRAN compilers generate highly optimized code.
Compiler Optimizations for Media Processors - Leupers (1999)(Correct)
In the design of embedded systems, programmable processors gain more and more
importance due to their high flexibility and potential for reuse. As a consequence, compilers
for embedded processors ar... / Compiler Optimizations for Media br for reuse. As a consequence compilers for embedded processors are
Continuation Passing Style in C and the Cost of Tail-call Elimination .. - Mason (1999)(Correct)
Continuation-Passing-Style has been used as a programming
style as well as a compilation technique in functional
programming languages for over 20 years. Recently it has
been discovered that CPS resol... / a convenient approach to building compilers for functional languages br The other is performance. If C compilers all implemented tail-call
Design of OpenMP Compiler for an SMP Cluster - Sato, Satoh, Kusano, Tanaka (1999)(Correct)
In this paper, we present a design of OpenMP compiler for an SMP cluster. Although clusters of SMPs are expected to be one of the cost-effective parallel computing platforms, both of inter and intra n... / Design of OpenMP Compiler for an SMP Cluster Mitsuhisa br we present a design of OpenMP compiler for an SMP cluster. Although
CD in Support of Rigorous Global Optimization - James Walte Rs (1999)(Correct)
GlobSol is a non-commercial software package for solving problems in global optimization
and non-linear systems. The optimizer requires derivative information in as many as 15 different
forms, includi... / Fortran source code for compiler optimization and full br arithmetic to the GNU g Fortran compiler. The enhanced g compiler
Generating Efficient Stack Code for Java - Tatiana Shpeisman (1999)(Correct)
Optimizing Java byte code is complicated by the fact that it uses a stack-based execution model.
Changing the intermediate representation from the stack-based to the register-based one brings the
prob... / into well-studied domain of compiler optimizations for registerbased br byte code is independent from any compiler that was used to generate it the
A Simple Implementation of the Bayesian Optimization Algorithm (BOA).. - Pelikan (1999)(Correct)
The paper explains how to download, compile, and use the simple implementation of the
Bayesian optimization algorithm (BOA) (Pelikan, Goldberg, & Cant'u-Paz, 1998; Pelikan, Goldberg,
& Cant'u-Paz, 199... / systems with a number of different compilers without major problems. We br to the name of a preferred Ccompiler on your machine. With a gcc
Parallelization of Radiation Therapy Treatment Planning (RTTP): A.. - Chaudhary, Xu, Roy, Jia (1999)(Correct)
Radiation therapy uses ionizing radiation to treat cancerous
tumors. This paper reports our experiences with the
parallelization of a real-world 3-D radiation therapy treatment
planning (RTTP) system ... / and Stanford SUIF parallelizing compiler. For comparison we also manually br tools and Stanford SUIF compilers. The results from automatic
Garbage Collection for Large Memory Java Applications - Krall, Tomsich (1999)(Correct)
The possible applications of Java range from small applets
to large, data-intensive scienti c applications allocating memory in the
multi-gigabyte range. As a consequence copying garbage collectors ... / Colnet et al. CCZ describe compiler support to customize the br sweep algorithm in the SmallEiel compiler. The SmallEiel garbage collector
MATCH: A MATLAB Compiler For Congurable Computing Systems - Banerjee Shenoy Choudhary (1999)(Correct)
1
Con#gurable computing systems constitute a new class of computing and communication systems
which are composed of con#gurable hardware capable of system-level adaptation. The objectiveofthe
MATCH... / MATCH A MATLAB Compiler For Con gurable Computing br The objectiveofthe MATCH MATlab Compiler for Heterogeneous computing
Compiling a Highlevel Language to Recongurable Systems - Hammes, Rinker, Böhm, Najjar (1999)(Correct)
This paper introduces SA-C, its optimizing compiler that generates data#ow graphs
#DFGs#, and the mapping of the DFGs to recon#gurable systems. unknown Compiling a Highlevel Language to Recongurable S... / to language designers and compiler writers. The task of programming br introduces SA-C its optimizing compiler that generates data ow graphs
Compiling for the Multiscalar Architecture - Vijaykumar (1998)(Correct)
High-performance, general-purpose microprocessors serve as compute engines for computers ranging from personal computers to supercomputers. Sequential programs constitute a major portion of real-world... / of performance and explore a few compiler optimization opportunities br To extract high degrees of ILP compiler heuristics partition programs
Putting Pointer Analysis To Work - Ghiya (1998)(Correct)
Pointer analysis has recently been a subject of active research. The focus of most
techniques is on: (1) estimating the targets for stack-directed pointers, (2) computing
relationships between heap-di... / results of pointer analysis for compiler optimizations. This thesis br information to a wide variety of compiler applications. That is once the
Theory and Practice of Constraint Handling Rules - Frühwirth (1998)(Correct)
Constraint Handling Rules (CHR) are our proposal to allow more flexibility and application-oriented customization of constraint systems. CHR are a declarative language extension especially designed fo... / typically a library containing a compiler and run-time system written in br FrBr b FrBr includes a compiler a run-time system with debugger
Path-based Compilation - Young (1998)(Correct)
Many compilers use profiles of programs to direct the focus and degree of
performance optimizations. Profiles are statistics from program runs, usually
collected at individual points in the program te... / Page iii Abstract Many compilers use profiles of programs to br know. Stuart also taught my first compiler course. And thanking my advisor
Loop optimization for aggregate array computations - Liu, Stoller (1998)(Correct)
An aggregate array computation is a loop that computes
accumulated quantities over array elements.
Such computations are common in programs that use
arrays, and the array elements involved in such com... / is beyond the scope of previous compiler optimizations. br are not achievable by previous compiler optimizations. Methods of
Dependence Analysis for Recursive Data - Liu (1998)(Correct)
This paper describes a general and powerful method for
dependence analysis in the presence of recursive data constructions.
The particular analysis presented is for identifying
partially dead recursiv... / analysis is the basis of compiler optimizations and program br memory management an important compiler optimization is to reduce
Path-Sensitive Value-Flow Optimizations - Bodík (1998)(Correct)
Observations of values computed during program execution suggests that compilers
miss numerous optimization opportunities: even in highly optimized programs, up
to 40% of executed instructions compu... / program execution suggests that compilers miss numerous optimization br optimizations are the backbone of compiler techniques for enhancing
Constraint-Based Array Dependence Analysis - William Pugh, David Wonnacott (1998)(Correct)
This article describes techniques for phrasing these questions in terms of systems
of constraints. Conditional dependence analysis can be performed with a constraint operation
we call the "gist" opera... / limitations of analysis cause many compilers to overlook large amounts of br programmer or other phases of the compiler. This article also documents our
Software Approach to Hazard Detection Using On-line Analysis of.. - Plale (1998)(Correct)
Safety critical systems are pervasive in modern society. Financial systems, transportation systems,
medical record retrieval systems, and air traffic control systems are all could potentially
threaten... / . . Compiler . br Cnet consists of a language and compiler an analysis component consisting
A Compiler Optimization Algorithm for Shared-Memory Multiprocessors - McKinley (1998)(Correct)
This paper presents a new compiler optimization algorithm that parallelizes applications for symmetric, sharedmemory
multiprocessors. The algorithm considers data locality, parallelism, and the granul... / A Compiler Optimization Algorithm for br This paper presents a new compiler optimization algorithm that
Measuring and Optimizing CORBA Latency and Scalability Over.. - Gokhale, Schmidt (1998)(Correct)
There is increasing demand to extend object-oriented middleware,
such as OMG CORBA, to support applications with
stringent quality of service (QoS) requirements. However,
conventional CORBA Object Req... / Repository Repository Idl Idl Compiler Compiler Dii Dii Orb Orb br Repository Idl Idl Compiler Compiler Dii Dii Orb Orb Interface
An ILP Approach for Optimizing Cache Locality - Kandemir, Banerjee, Choudhary.. (1998)(Correct)
The delivered performance on modern processors that employ deep memory hierarchies is closely
related to the performance of the memory subsystem. Compiler optimizations aimed at improving cache
locali... / of the memory subsystem. Compiler optimizations aimed at improving br tools has led to much work on compiler optimizations over the last
From Polyvariant Flow Information to Intersection and Union Types - Palsberg, Pavlopoulou (1998)(Correct)
Many polyvariant program analyses have been studied in the 1990s,
including k-CFA, poly-k-CFA, and the cartesian product algorithm.
The idea of polyvariance is to analyze functions more than once and
... / analysis include the optimizing compilers of Hendren et al and br Mossin and a simplified compiler structure Wells et al
An overview of Types in Compilation - Leroy (1998)(Correct)
een integers
numbers and floating-point numbers at compile-time. The main motivation
for this separation, according to Fortran's designers, was to avoid the difficulties
of handling mixed arithmetic a... / manipulated by the program the compiler can take advantage of these br Thanks to the type system the compiler knows when to generate integer
Automatic Accurate Time-Bound Analysis for High-Level Languages - Liu (1998)(Correct)
This paper describes a general approach for automatic and accurate time-bound analysis. The approach consists of transformations for building time-bound functions in the presence of partially known in... / systems interactive environments compiler optimizations performance br it for analysis in the presence of compiler optimizations pipelining
Parallelization in Calculational Forms - Hu, Takeichi (1998)(Correct)
The problems involved in developing efficient parallel programs have proved harder than those in developing efficient sequential ones, both for programmers and for compilers. Although program calculat... / ones both for programmers and for compilers. Although program calculation br the construction of parallelizing compiler. Several interesting examples
A Framework for Qualitative Performance Prediction - Hsu, Kremer (1998)(Correct)
Performance prediction models at the source code level are crucial components in advanced optimizing
compilers, programming environments, and tools for performance debugging. Compilers
and programming... / components in advanced optimizing compilers programming environments and br tools for performance debugging. Compilers and programming environments
Type-Based Alias Analysis - Diwan, McKinley, Moss (1998)(Correct)
This paper evaluates three alias analyses based on programming language types. The first analysis uses type compatibility to determine aliases. The second extends the first by using additional high-le... / of modern uniprocessors compilers must reorder instructions. For br programs that use pointers the compiler's alias analysis dramatically
Using Shape Analysis to Reduce Finite-State Models of Concurrent Java .. - Corbett (1998)(Correct)
Finite-state verification (e.g., model checking) provides a powerful means to detect concurrency errors, which are
often subtle and difficult to reproduce. Nevertheless, widespread use of this technol... / methods were developed for compiler optimization where accurate br any lock is released. This allows compilers a great deal of flexibility in
Value Profiling for Instructions and Memory Locations - Feller (1998)(Correct)
viii
I Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
A. Thesis Overview . . . .... / . B. Compiler Analysis for Dynamic Compilation br at compile-time allows the compiler to perform optimizations
Optimal Type Lifting - Saha, Shao (1998)(Correct)
Modern compilers for ML-like polymorphic languages have
used explicit run-time type passing to support advanced optimizations
such as intensional type analysis, representation analysis and tagless
g... / Abstract. Modern compilers for ML-like polymorphic br Introduction Modern compilers for ML-like polymorphic
Using Integer Sets for Data-Parallel Program Analysis and Optimization - Adve, Mellor-Crummey (1998)(Correct)
In this paper, we describe our experience with using an abstract
integer-set framework to develop the Rice dHPF compiler,
a compiler for High Performance Fortran. We present
simple, yet general formul... / framework to develop the Rice dHPF compiler a compiler for High Performance br develop the Rice dHPF compiler a compiler for High Performance Fortran. We
Mobile Object Layer: A data migration framework for Active Messages.. - Hawblitzel, Chrisochoides (1998)(Correct)
Data locality is critical to good performance on the distributed memory machines, so
load balancing in dynamic, irregular applications requires the movement of both data and
computation. The Mobile Ob... / developers but also to parallel compiler writers. . Dynamic Load br application programmer or parallel compiler in the following two tasks A
Compiler Support for Real-Time Programs - Gerber, Hong (1998)(Correct)
Introduction
One of the primary challenges of building a real-time system lies in balancing its
functional requirements against its temporal requirements. Functional requirements
define valid transla... / Chapter Compiler Support for Real-Time Programs br and Seongsoo Hong We present a compiler-based approach to assist
A Practical Framework for Demand-Driven Interprocedural Data Flow.. - Duesterwald, Gupta, Soffa (1998)(Correct)
this article, we present a general framework
for developing demand-driven interprocedural data flow analyzers and report our experience in
evaluating the performance of this approach. A demand for dat... / optimizing and parallelizing compilers. In addition data flow analysis br Optimizations. Optimizing compilers typically perform a number of
Performance Analysis for Mesh and Mesh-Spectral Archetype Applications - Rifkin, Massingill (1998)(Correct)
This document outlines a simple method for benchmarking a parallel
communication library and for using the results to model the performance
of applications developed with that communication library. W... / to do performance measurement for compiler optimization as Clement and br the target architecture language compiler and library. Computational
alto: A Link-Time Optimizer for the DEC Alpha - Muth, Debray, Watterson (1998)(Correct)
Traditional optimizing compilers are limited in the scope of their optimizations by the fact that only a single
function, or possibly a single module, is available for analysis and optimization. In pa... / Abstract Traditional optimizing compilers are limited in the scope of br compiled with a good optimizing compiler with a high level of
Correctness of Monadic State: An Imperative Call-by-Need Calculus - Ariola, Sabry (1998)(Correct)
The extension of Haskell with a built-in state monad combines
mathematical elegance with operational efficiency:
ffl Semantically, at the source language level, constructs
that act on the state are v... / in the optimization phase of the compiler. This discovery motivates the br the intermediate language of the compiler together with a type-preserving