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.
10464.1 Optimizing Fortran90D/HPF for Distributed-Memory Computers - Roth (1997)(Correct)
High Performance Fortran (HPF), as well as its predecessor FortranD, has attracted
considerable attention as a promising language for writing portable parallel programs
for a wide variety of distribut... / parallel machine an HPF compiler must do a superb job of br as is done in many Fortran compilers. The optimizations address the
9704.1 The Many Faces Of Introspection - Rok Sosic (1992)(Correct)
Introspection or the ability to observe one's own behavior is one of the most powerful
capabilities of human intelligence; it is the basis for understanding and improvement
of one's behavior and of hu... / . . Dynascope Compiler br Christopher Fraser for their lcc compiler and for their explanation of the
9637.0 Compilation Techniques for Parallel Systems - Gupta, Pande, Psarris, Sakar(Correct)
Over the past two decades tremendous progress has been made in both the design of parallel architectures
and the compilers needed for exploiting parallelism on such architectures. In this paper we sum... / of parallel architectures and the compilers needed for exploiting br relationship between the nature of compiler support and type of processor
9438.6 Designing Optimal Parallel Volume Rendering Algorithms - Wittenbrink (1993)(Correct)
Designing Optimal Parallel Volume Rendering
Algorithms
by Craig Michael Wittenbrink
Chairperson of the Supervisory Committee: Professor Arun K. Somani
Department of Electrical Engineering
and Departm... / . Slowdown Compiler Techniques . br and functional and parallelizing compilers convert sequential to parallel
8851.4 Compilation Techniques for Prolog - Lindgren (1996)(Correct)
Lindgren, T. 1996: Compilation Techniques for Prolog, Uppsala Theses in Computing
Science 26. 36pp. Uppsala. ISSN 0283-359X, ISBN 91-506-1181-X.
Current Prolog compilers are largely limited to optimiz... / - - -X. Current Prolog compilers are largely limited to br Lindgren J. Bevemyr H. Millroth Compiler Optimizations in Reform Prolog
8198.6 Automatic and Interactive Parallelization - McKinley (1994)(Correct)
The goal of this dissertation is to give programmers the ability to achieve high performance
by focusing on developing parallel algorithms, rather than on architecturespecific
details. The advantages ... / a common bus. In particular the compiler maps complete applications onto br programming tool which combines compiler analysis and algorithms with
7747.9 Uniprocessor Garbage Collection Techniques - Wilson (1992)(Correct)
We survey basic garbage collection algorithms, and variations such as incremental and generational collection; we then discuss low-level implementation considerations and the relationships between sto... / systems languages and compilers. Throughout we attempt to br and Smart Pointers . Compiler Cooperation and Optimizations
7475.7 Adaptive Optimization For Self: Reconciling High Performance With.. - Hölzle (1994)(Correct)
Object-oriented programming languages confer many benefits, including abstraction, which lets the programmer hide
the details of an object's implementation from the object's clients. Unfortunately, cr... / inefficient programs. Aggressive compiler optimizations can reduce the br times introduced by optimizing compilers delay the programming
7234.9 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
7143.6 Thal: An Actor System For Efficient And Scalable Concurrent Computing - Kim (1997)(Correct)
Actors are a model of concurrent objects which unify synchronization and data abstraction
boundaries. Because they hide details of parallel execution and present an abstract view of the
computation, a... / an experimental runtime system and compiler. The THAL runtime system br resources. The THAL compiler incorporates a number of analysis
7049.5 Distributed Discrete Event Simulation: Optimistic Protocols With.. - Lüthi(Correct)
this paper is
meanwhile published as: A. Ferscha and J. Luthi. "Estimating Rollback Overhead for Optimism Control in Timewarp". In: Proceedings
of the 28 unknown Distributed Discrete Event Simulation:... / ffl A parallelizing compiler can be used. ffl Independent br for both many enhancements and optimization techniques have been
7014.7 Design, Analysis and Reasoning about Tools: Abstracts from the Third.. - Nielson, (Ed.) (1993)(Correct)
s from the Third Workshop
Flemming Nielson
(editor)
October 1993
1 Introduction
The third DART workshop took place on Thursday August l9th and Friday
August 20th at the Department of Computer Science... / applications were to develop compilers from interpreters and br and automatically to produce compiler generators. Significant recent
6287.2 Whole-Program Optimization of Object-Oriented Languages - Dean (1996)(Correct)
Whole-Program Optimization of Object-Oriented Languages
by Jeffrey Adgate Dean
Chairperson of the Supervisory Committee: Professor Craig Chambers
Department of Computer
Science and Engineering
This di... / analysis which provides the compiler with knowledge of the class br and extensibility but permits the compiler to optimize away this
6194.3 Hierarchical Modularity And Intermodule Optimization - Blume (1997)(Correct)
Separate compilation is an important tool for coping with design complexity in large
software projects. When done right it can also be used to create software libraries, thus
promoting code reuse. But... / for everyday use in the SML NJ compiler. It preserves separate br A. Using CM for compiling the compiler .
6177.1 Hardware And Software Mechanisms For Reducing Load Latency - Austin (1996)(Correct)
As processor demands quickly outpace memory, the performance of load instructions becomes an
increasingly critical component to good system performance. This thesis contributes four novel load
latency... / Experimental Framework . Compiler Tools br . . Additional Compiler Support for Zero-Cycle Loads
5981.4 High-Performance All-Software Distributed Shared Memory - Johnson (1995)(Correct)
The C Region Library (CRL) is a new all-software distributed shared memory (DSM) system.
CRL requires no special compiler, hardware, or operating system support beyond the ability to
send and receive ... / system. CRL requires no special compiler hardware or operating system br systems. CRL requires no special compiler hardware or operating system
5878.2 Efficient Data Parallel Implementations of Highly Irregular Problems - Hu (1997)(Correct)
This dissertation presents optimization techniques for efficient data parallel formulation
/implementation of highly irregular problems, and applies the techniques to O(N) hierarchical
N--body method... / are feasible with proper language compiler runtime support. Our data br for evaluating and improving HPF compilers. This thesis also develops the
5864.9 Efficient Machine-Independent Programming of High-Performance.. - Tseng (1995)(Correct)
mainly because the cost of interprocessor communication is too great compared to computation and local memory
accesses [74, 77]. To achieve high performance, COSMIC will perform communicationanalysis ... / architecture. For uniprocessors compilers have been quite successful in br microprocessors. I believe that compilers are also well-suited for
5839.9 Superscalar Performance in a Multithreaded Microprocessor - Gunther (1993)(Correct)
Multithreaded processors, having hardware support for the concurrent
execution of fine-grained threaded computations, are noted for their latency
tolerance and low-cost synchronization. Multithreading... / Parry for his efforts with the lcc compiler back-end. The support of many br verification John Uht Compilers too will have to cooperate in
5729.9 Interprocedural Symbolic Analysis - Havlak (1994)(Correct)
Interprocedural Symbolic Analysis
by Paul Havlak
Compiling for efficient execution on advanced computer architectures requires
extensive program analysis and transformation. Most compilers limit thei... / analysis and transformation. Most compilers limit their analysis to simple br techniques in a production compiler is justified by their
5637.8 Communication Generation for Data-Parallel Languages - Sethi (1996)(Correct)
Data-parallel languages allow programmers to use the familiar machine-independent
programming style to develop programs for multiprocessor systems. These languages
relieve users of the tedious task of... / and error-prone task to the compilers for the languages. Since remote br languages depends heavily on the compiler's ability to reduce the
5587.7 Mechanisms and Interfaces for Software-Extended Coherent Shared Memory - Chaiken (1994)(Correct)
Software-extended systems use a combination of hardware and software to implement
shared memory on large-scale multiprocessors. Hardware mechanisms accelerate
common-case accesses, while software hand... / from the runtime system to the compiler. The compiler uses this br system to the compiler. The compiler uses this information to optimize
5510.7 Symbolic Analysis for Parallelizing Compilers - Haghighat (1994)(Correct)
Symbolic Domain
The objects in our abstract symbolic domain are canonical symbolic expressions. A
canonical symbolic expression is a lexicographically ordered sequence of symbolic
terms. Each symboli... / Analysis for Parallelizing Compilers MOHAMMAD R. HAGHIGHAT Intel br for the Parafrase- parallelizing compiler. This framework extends the scope
5385.2 Automating Runtime Optimizations For Parallel Object-Oriented.. - Krishnan(Correct)
Software development for parallel computers has been recognized as one of the bottlenecks
preventing their widespread use. In this thesis we examine two complementary approaches
for addressing the cha... / . . Compiler and runtime optimizations br cycle iterates back to step . Compiler Language Programmer Expert
5215.5 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
5068.0 Massively Parallel Computing: Mathematics and communications libraries - Johnsson, Mathur (1993)(Correct)
Massively parallel computing holds the promise of extreme performance. The utility of
these systems will depend heavily upon the availability of libraries until compilation and run--
time system techn... / The techniques are incorporated as compiler directives for the Connection br In mature architectures compiler generated code with supporting
5064.8 The ParaScope Parallel Programming Environment - Cooper (1993)(Correct)
The ParaScope parallel programming environment, developed to support scientific programming of sharedmemory
multiprocessors, includes a collection of tools that use global program analysis to help use... / the traditional single-procedure compiler by providing a mechanism for br The ParaScope editor brings both compiler analysis and user expertise to
5045.6 A Survey of Program Slicing Techniques - Tip (1995)(Correct)
A program slice consists of the parts of a program that (potentially) affect the
values computed at some point of interest, referred to as a slicing criterion. The task
of computing program slices is ... / are investigated. We discuss how compiler-optimization techniques can be br Section . Section suggests how compiler-optimization techniques may be
5038.8 Memory Models - Leonidas Kontothanassis (1996)(Correct)
this memory usually consists
of highly-interleaved SRAM, and is a major---perhaps the dominant---component in the cost
of these machines. Even so, supercomputer compilers must employ aggressive prefet... / and the quality of the compiler. A good rule of thumb however br machines. Even so supercomputer compilers must employ aggressive
4965.4 Automatic Data Layout for Distributed Memory Machines - Kremer (1993)(Correct)
An approach to programming distributed memory-parallel machines that has recently become popular is one where the programmer explicitly specifies the layout of data in a global name space, relying on ... / a global name space relying on a compiler to generate a parallel program br operations generated by the compiler. This will enable the user to
4876.1 An Object-Oriented Library for Shared-Memory Parallel Simulations - Machanick (1996)(Correct)
Programming shared-memory multiprocessor systems is becoming increasingly
difficult as the gap between memory speed and processor speed increases. At the same
time, this class of computer---based on s... / . Algorithmic Strategies and Compiler Optimizations br because most work on automatic or compiler optimizations which reduce
4699.6 Transformations On Dependency Graphs: Formal Specification And.. - Rajan (1995)(Correct)
Dependency graphs are used to model data and control flow in hardware and
software design. In a transformational design approach, optimization and refinement
transformations are used to transform depe... / systems optimizing compilers data-flow languages and br Other Domains . Optimizing Compiler Transformations
4675.5 The Compilation and Execution of Recursion-Parallel Prolog on Shared.. - Lindgren (1993)(Correct)
The parallel execution of logic programs, in particular written in Prolog, has great
potential for efficient high-level parallel programming. Previous efforts have targeted
the parallel execution of c... / hierarchy of data sharing that the compiler attempts to exploit. Analysis br range of benchmarks show that the compiler is frequently successful in
4645.5 A Linear Algebra Framework for Static HPF Code Distribution - Ancourt, Coelho, Irigoin, Keryell (1995)(Correct)
High Performance Fortran (hpf) was developed to support data parallel
programming for simd and mimd machines with distributed memory. The programmer
is provided a familiar uniform logical address spac... / distribution by directives. The compiler then exploits these directives to br Fourth International Workshop on Compilers for Parallel Computers held in
4404.8 Optimizing Fortran 90D Programs for SIMD Execution - Roth (1993)(Correct)
SIMD architectures offer an alternative to MIMD architectures for obtaining high
performance computation through parallelism. These architectures can offer impressive
price/performance ratios for cert... / by the capabilities of the compilers which produce code for it. br produce code for it. Current compilers have many weaknesses that
4374.9 Inter-Block Code Motion without Copies - Sweany (1992)(Correct)
OF DISSERTATION
INTER-BLOCK CODE MOTION WITHOUT COPIES
Code motion is an important optimization for any compiler, and the necessity to
include instruction scheduling in compilers for instruction-level... / an important optimization for any compiler and the necessity to include br include instruction scheduling in compilers for instruction-level-parallel
4367.6 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
4338.9 Recent Developments in High-Level Synthesis - Lin (1997)(Correct)
ing with credit is permitted. To copy otherwise, to republish,
to post on servers, to redistribute to lists, or to use any component
of this work in other works, requires prior specific permission and... / usually includes a series of compiler-like optimizations such as code br control data flow graph several compiler-like optimizations can be
4325.4 Compiling Techniques for Improving Decoupled Virtual Shared Memory.. - Zhu(Correct)
Virtual Shared Memory (VSM) is a promising architectural technique for distributed
memory multiprocessors. Decoupling prefetching can be used with VSM to overcome
the problem of long memory latency by... / VSM systems. After that some compiler-based techniques are discussed br Consistency If programmers or compilers make sure that no consistency
4324.4 Language and Compiler Issues in Scalable High Performance Scientific.. - Johnsson (1992)(Correct)
Library functions for scalable architectures must be designed to correctly and efficiently
support any distributed data structure that can be created with the supported languages
and associated compil... / Language and Compiler Issues in Scalable High br Springer-Verlag. Language and Compiler Issues in Scalable High
4294.3 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
4259.8 Parallelizing Unstructured Sparse Matrix Computations On Large-Scale.. - Venugopal (1993)(Correct)
OF THE DISSERTATION
Parallelizing Unstructured Sparse Matrix Computations
on Large-scale Multiprocessors
by Seshadri Venugopal, Ph.D.
Dissertation Director: Professor Gerard Richter
Problems in the cl... / of problems current parallelizing compilers are unable to produce efficient br . . Compiler techniques for parallelization
4252.4 Loop Optimization for Aggregate Array Computations - Liu, Stoller (1997)(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... / it is beyond the scope of previous compiler optimizations. br for arrays such as various APL compiler optimizations loop
4166.7 Active Rules based on Object Relational Queries - Efficient Change.. - Sköld(Correct)
The role of databases is changing because of the many new applications that
need database support. Applications in technical and scientific areas have a
great need for data modelling and application-d... / transaction is committed. A rule compiler generates screener predicates br formally as a way for the rule compiler to automatically generate
4128.6 Data Layout Optimizations for High-Performance Architectures - Chau-Wen Tseng(Correct)
padding, transposing, and reindexing array
dimensions, and modifying heap allocation policies. Most optimizations must be applied at compile time,
but link-time and run-time optimizations are also pos... / Experience has shown that compilers can automatically restructure br as passes in the Stanford SUIF compiler. A prototype implementation can
4073.6 Compiling Object-Oriented Queries - Leung (1993)(Correct)
The effectiveness of database query optimization is dependent on the optimizer's ability to
make efficient use of physical resources in a computer system. The optimizer decides how to use
those resour... / presented are reminiscent of compiler optimizations. We conclude by br been discussing. . Analogy to Compilers There are some interesting
4008.2 Program Restructuring as an Aid to Software Maintenance - Griswold (1991)(Correct)
Program Restructuring
as an Aid to Software Maintenance
by William G. Griswold
Chairperson of the Supervisory Committee: Professor David Notkin
Department of Computer Science
and Engineering
Maintenan... / . Transformations in Compiler Optimization br . Transformations in Compiler Optimization Many of the
3975.3 Hardware Support for Flexible Distributed Shared Memory - Reinhardt, al.(Correct)
Workstation-based parallel systems are attractive due to their low cost and competitive uniprocessor
performance. However, supporting a cache-coherent global address space on these systems involves si... / by exploiting programmer or compiler knowledge of an applica- br by exploiting programmer or compiler knowledge of an application's
3973.8 Implementation of a Portable Nested Data-Parallel Language - Blelloch, Chatterjee, Hardwick.. (1994)(Correct)
This paper gives an overview of the implementation of NESL, a portable nested data-parallel language.
This language and its implementation are the first to fully support nested data structures as well... / nested parallelism allows a compiler to convert them into a form that br Fortran and CM Fortran compilers generate near-optimal code. The
3973.4 Rule-Based Program Restructuring For High Performance Parallel.. - Tenny (1992)(Correct)
Writing good programs for high performance parallel computers is difficult. The
programmer must have a deep understanding of the underlying machine architecture.
Issues such as memory hierarchy, commu... / For serial machines well-known compiler optimization techniques are br required of a restructuring compiler. We develop rule-based methods
3922.3 Compiler Optimizations For Parallel Loops With Fine-Grained.. - Chen (1994)(Correct)
this paper, we presented and evaluated a new runtime
algorithm to parallelize these loops. Our scheme handles any type of data dependence pattern without
requiring any special architectural support. F... / Compiler Optimizations For Parallel Loops br Flcopyright By Ding-Kai Chen Compiler Optimizations For Parallel Loops
3898.5 Code Generation Algorithms For Digital Signal Processors - Araujo (1997)(Correct)
The dramatic reduction in the cost of electronic devices combined with large improvements in design productivity due to the use of automatic tools are gradually opening up the possibility for high-per... / with code from the best optimizing compiler available for the target DSP. br code needs to be produced by the compiler a task called code generation.
3898.0 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
3831.1 Compiling Fortran 90D/HPF For Distributed Memory Mimd Computers - Bozkus (1995)(Correct)
Distributed memory multiprocessors are increasingly being used to provide high
performance for advanced calculations with scientific applications. Distributed memory
machines offer significant advanta... / This thesis describes an advanced compiler that can generate efficient br D HPF was implemented. The compiler is organized around several
3791.9 Automatic Interprocedural Optimization for Object-Oriented Languages - Plevyak, Chien (1996)(Correct)
The structure of object-oriented programs differs from that of procedural programs, requiring special
compilation techniques to obtain efficiency. Object-orientation introduce additional layers of abs... / behind abstract interfaces. Compilers for such languages must be able br time an abstraction is used the compiler must apply an interprocedural
3700.5 Specializing Code via Partial Evalutaion - Krishna (1994)(Correct)
This document introduces the concept of program specialization and partial evaluation highlighting
some of the insights that went into the maturity of the fields. After an informal discussion
and moti... / optimization techniques used in compilers ex. constant propagation dead br The code optimizer in the compiler exploits the structure of the
3670.8 From ML to Ada(!?!): Strongly-typed Language Interoperability via.. - Tolmach, Oliva (1997)(Correct)
We describe a system that supports source-level integration of ML-like functional language
code with ANSI C or Ada83 code. The system works by translating the functional code into
type-correct, "vanil... / output of current optimizing ML compilers even though handicapped by a br details of FL and GL compilers which may be unacceptable in
3667.7 Interactive Parallel Programming Using the ParaScope Editor - Kennedy, McKinley, Tseng (1991)(Correct)
The ParaScope project is developing an integrated collection of tools to help scientific programmers
implement correct and efficient parallel programs. The centerpiece of this collection
is the ParaSc... / the abilities of programmers and compiler writers alike. Programmers eager br a directive that instructs the compiler to ignore all dependences. The
3617.3 Static Cache Simulation and its Applications - Mueller (1994)(Correct)
This work takes a fresh look at the simulation of cache memories. It introduces the technique
of static cache simulation that statically predicts a large portion of cache references.
To efficiently ut... / design. In addition new compiler optimization techniques are often br within the environment of a compiler back-end. The simulator attempts
3544.9 Representing Control in Parallel Applicative Programming - Yao (1994)(Correct)
This research is an attempt to reason about the control of parallel computation in the
world of applicative programming languages.
Applicative languages, in which computation is performed through func... / for Pscheme and develop a compiler and a run time system on NYU's br The Compiler . Intermediate
3543.8 Practical Dependence Testing - Goff, Kennedy, Tseng (1991)(Correct)
Precise and efficient dependence tests are essential to
the effectiveness of a parallelizing compiler. This paper
proposes a dependence testing scheme based on classifying
pairs of subscripted variabl... / effectiveness of a parallelizing compiler. This paper proposes a br in both PFC a parallelizing compiler and ParaScope a parallel
3528.5 Hot Potato Techniques in High Level Synthesis - Potkonjak, Dey(Correct)
This paper introduces hot potato high level synthesis transformation techniques. These techniques add
deflection operations in the behavioral description of a computation in such a way that the requir... / and commercial domains including compilers Fis database systems br approaches. For example compiler transformations techniques are
3510.7 Quantifying Behavioral Differences Between C and C++ Programs - Calder, Grunwald, Zorn (1995)(Correct)
Improving the performance of C programs has been a topic of great interest for many years. Both hardware technology and compiler optimization research has been applied in an effort to make C programs ... / Both hardware technology and compiler optimization research has been br results should be of interest to compiler writers and architecture
3488.9 The Proteus System for the Development of Parallel Applications - Goldberg, Prins, Reif, Faith, Li.. (1994)(Correct)
Target Language
In our methodology we have identified a small set of specifications that comprise the abstract target language (ATL)
of the refinement system. These are specifications of types such a... / codes at a high level having a compiler translate the codes to run on a br parallel computing and adequate compilers the above approach gives the
3470.5 Compiling for Heterogeneous Systems: A Survey and an Approach - McKinley, Moss, Singhai, Weaver.. (1995)(Correct)
Large applications tend to contain several models of parallelism, but only a few of these map efficiently to the single model of parallelism embodied in a homogeneous parallel system. Heterogeneous pa... / development. We believe that compilers can and should assist in br identify four goals for extending compilers to assist with managing
3438.4 Studies of Integration and Optimization of Interpreted and Compiled.. - Fox, Li, Wen, Zhang (1997)(Correct)
an view
our front end compiler as similar to the javac compiler's function of producing JavaVM
bytecodes. The II/CVM will naturally need the study of such issues as Just in Time compilation,
dynamic l... / which explore the interpreter compiler integration for both sequential br Our central idea is a front end compiler that produces intermediate code
3436.9 A Hardware Engine for Genetic Algorithms - Scott, Seth, Samal (1997)(Correct)
A genetic algorithm (GA) is an optimization method based on natural selection. Genetic algorithms have been applied to many hard optimization problems including VLSI layout optimization, boolean satis... / In Function To The Prism Ii Compiler The Spc Compiler br II compiler the spC compiler Flamel Cyber or
3416.0 Pattern-Driven Automatic Parallelization - Christoph W. Keßler (1996)(Correct)
This paper describes a knowledge--based system for automatic parallelization of a wide class of
sequential numeric codes operating on vectors and dense matrices, and for execution on distributed
memor... / problems that a parallelizing compiler is faced with are the following br form of language constructs or compiler directives in an explicitly
3401.5 An Approach for Improving Execution Performance in Inference Network.. - Brown (1994)(Correct)
The inference network retrieval model provides the ability to combine a variety of retrieval strategies
expressed in a rich query language. While this power yields impressive retrieval effectiveness, ... / to the insanity of the concordance compiler With the advent of the br the incorporation of traditional optimization techniques intended to improve
3395.5 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
3384.9 FIAT: A Framework for Interprocedural Analysis and Transformation - Carle, Hall, Mellor-Crummey.. (1995)(Correct)
Modern architectures with deep memory hierarchies or parallelism require the use of increasingly
sophisticated code analysis and optimization to achieve maximum performance for large, scientific progr... / at Rice University and the SUIF compiler at Stanford University. Fiat's br of a distributed-memory compiler for Fortran D an interactive
3371.8 Deductive Databases: A short Overview for The Handbook of Data Mining .. - Zaniolo(Correct)
Introduction
Relational databases, which support simple logic-based query languages [13] were proposed
in early 70s [12]. Initially considered too theoretical and not conducive to efficient
implement... / techniques are used by the compiler to realize this improvement br is bound and the second is free. Compilers use these bound free adornments
3368.0 Optimizing Incremental State Saving and Restoration - Gomes (1996)(Correct)
Computer simulation is a valuable tool for the design and analysis of complex systems.
However, the simulation of large complex systems such as, telecommunication,
traffic, manufacturing, combat, trai... / state logging and transparency. A compiler based design for an incremental br It is further argued that the compiler design not only solves the
3347.0 Slicing Real-Time Programs for Enhanced Schedulability - Gerber, Hong(Correct)
In this paper we present a compiler-based technique to help develop correct real-time systems.
The domain we consider is that of multi-programmed real-time applications, in which periodic
tasks contro... / In this paper we present a compiler-based technique to help develop br technologies from optimizing compilers and fixed-priority scheduling.
3341.3 A Comprehensive Approach to Parallel Data Flow Analysis - Yong-Fong Lee(Correct)
We present a comprehensive approach to performing data flow analysis in parallel. We identify three types
of parallelism inherent in the data flow solution process: independent-problem parallelism, se... / parallelization BC PW and compiler optimization This br For example an optimizing compiler cannot perform aggressive
3328.6 The CIAO Parallel Execution Environment for (C)LP Languages: A.. - Hermenegildo, Bueno, Cabeza, Carro..(Correct)
1 Introduction
CIAO [41, 40] is a multi-paradigm compiler, run-time, and program development system which is
aimed at providing efficient implementations of a range of logic programming (LP), constra... / CIAO is a multi-paradigm compiler run-time and program br extends the Prolog parallelizing compiler to support several logic
3313.9 Compiler Generation for Interactive Graphics using Intermediate Code - Draves (1996)(Correct)
This paper describes a compiler generator (cogen) designed for interactive
graphics, and presents preliminary results of its application to pixel-level
code. The cogen accepts and produces a reflect... / Compiler Generation for Interactive br Abstract. This paper describes a compiler generator cogen designed for
3299.0 Two for the Price of One: Composing Partial Evaluation and Compilation - Sperber, Thiemann (1997)(Correct)
One of the flagship applications of partial evaluation is compilation and compiler generation. However, partial evaluation is usually expressed as a source-to-source transformation for high-level lang... / evaluation is compilation and compiler generation. However partial br languages whereas realistic compilers produce object code. We close
3285.5 Optimizing a CORBA Inter-ORB Protocol (IIOP) Engine for Minimal.. - Gokhale, Schmidt(Correct)
To support the quality of service (QoS) requirements of embedded
multimedia applications, such as real-time audio and
video, electronic mail and fax, and Internet telephony, off-theshelf
middleware li... / applied to TAO's IDL compiler to generate efficient and small br de marshaling. Moreover our IDL compiler optimizations generate
3283.8 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
3279.7 Optimizing COOP Languages: Study of a Protein Dynamics Program - Xingbin Zhang (1996)(Correct)
Fine-grained concurrent object-oriented programming
(COOP) models which provide a shared namespace,
object-level concurrency and implicit dynamic
thread creation can simplify the programming of irregu... / relies only on thread-oriented compiler and runtime optimizations and br that can be automated in a compiler we demonstrate two
3277.1 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
3264.9 The LDL System Prototype - Chimenti, Gamboa, Krishnamurthy.. (1996)(Correct)
The LDL system provides a declarative logic-based language and
integrates relational database and logic programming technologies so
as to support advanced data and knowledge-based applications. This
p... / of designing a more sophisticated compiler to support the full br completed in was based on a compiler using an early version of a
3248.7 Using Information from the Programmer to Implement System.. - Adve (1996)(Correct)
The memory consistency model of a shared-memory system is a formal specification of the semantics of sharedmemory.
The most commonly assumed model, sequential consistency, provides simple semantics bu... / Shasha and Snir in the context of compiler analysis. The work by Shasha and br systems including hardware and compiler overlap and reorder memory
3231.1 Compiling Polymorphism Using Intensional Type Analysis - Harper, Morrisett (1995)(Correct)
Traditional techniques for implementing polymorphism use a universal representation for objects of unknown type. Often, this forces a compiler to use universal representations even if the types of obj... / type. Often this forces a compiler to use universal representations br Introduction Many compilers assume a universal or boxed
3226.0 From ML to Ada: Strongly-typed Language Interoperability via Source.. - Tolmach, Oliva (1993)(Correct)
We describe a system that supports source-level integration of ML-like functional language
code with ANSI C or Ada83 code. The system works by translating the functional
code into type-correct, "vanil... / output of current optimizing ML compilers even though handicapped by a br details of FL and GL compilers which may be unacceptable in
3173.6 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
3158.6 Scout: A Communications-Oriented Operating System - Montz, Mosberger, O'Malley.. (1994)(Correct)
This white paper describes Scout, a new operating system being designed for systems connected to the National Information Infrastructure (NII). Scout provides a communication-oriented software archite... / with the application of advanced compiler techniques result in a system br to the overall system. . Compiler Support A key design principle
3157.5 Final Report on Research in Parallel Computing: Network-based.. - December Carnegie (1996)(Correct)
No existing parallel architecture (including SIMD machines, MIMD machines, vector processors, machines with a
common, globally-addressable memory, machines with private memories) has demonstrated its ... / the development of an optimizing compiler for iWarp and the design of a br design of a runtime system. . Compiler issues The design of the
3117.0 Compiler Technology for Future Microprocessors - Hwu, Hank, Gallagher, Mahlke.. (1995)(Correct)
Advances in hardware technology have made it possible for microprocessors to execute a large
number of instructions concurrently (i.e., in parallel). These microprocessors take advantage of
the opport... / Compiler Technology for Future br In particular the quality of compilers can make an order of magnitude
3114.4 A Comparative Revisitation of Some Program Transformation Techniques - Pettorossi, Proietti (1996)(Correct)
We revisit the main techniques of program transformation
which are used in partial evaluation, mixed computation, supercompilation,
generalized partial computation, rule-based program derivation,
pr... / for instance program derivation compiler generation and program br evaluator for experiments in compiler generation. LISP and Symbolic
3100.4 Program Analysis Position Statement: The Abstract Interpretation.. - Cousot (1996)(Correct)
Interpretation Perspective
Patrick Cousot
Program Analysis Position Statement:
ffl Semantic analysis (of programs, systems, etc.) should
become a mature discipline to be included in educational
cur... / guaranteeing the correctness of a compiler optimization ffl br a practical activity close to compiler design and development In a
3099.1 Massively Parallel Programming Languages - A Classification of Design .. - Gellerich, Gutzmann(Correct)
This paper presents the results of a study in which
we examined about 50 parallel programming languages
in order to detect typical approaches towards supporting
massive parallelism. Based on a classif... / tasks performed by parallelizing compilers. We were interested in br the parallelization method of a compiler properties of a certain machine
3084.0 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
3075.9 Design Issues In High Performance Floating Point Arithmetic Units - Oberman (1996)(Correct)
In recent years computer applications have increased in their computational complexity.
The industry-wide usage of performance benchmarks, such as SPECmarks, forces processor
designers to pay particul... / . . . Compiler Effects . br List of Tables . Effects of compiler optimization .
3066.6 An Application of Pattern Matching in Intrusion Detection - Kumar, Spafford (1994)(Correct)
This report examines and classifies the characteristics of signatures used in misuse intrusion detection. Efficient algorithms to match patterns in some of these classes are described. A generalized m... / in sec . . The applicability of compiler optimization techniques to speed br relative usage of each mailer compiler shell and editor in the system
3060.2 Towards a tool kit for the automatic generation of interprocedural.. - Knoop, Rüthing, Steffen (1996)(Correct)
this article, the classical application
of DFA.
In this context, designers of a DFA are typically faced with the problem of how to
construct an algorithm that determines the set of program points of a... / the construction of optimizing compilers. We focus on the generation of br of efficient code by optimizing compilers in this article the classical
3046.6 A Debugger for Standard ML - Tolmach, Appel (1993)(Correct)
We have built a portable, instrumentation-based, replay debugger for the Standard ML of
New Jersey compiler. Traditional "source-level" debuggers for compiled languages actually
operate at machine lev... / for the Standard ML of New Jersey compiler. Traditional source-level br to port and intolerant of compiler optimization. For secure
3045.7 Implementation of Stack-Based Languages on Register Machines - Ertl (1996)(Correct)
Languages with programmer-visible stacks (stack-based languages) are
used widely, as intermediate languages (e.g., JavaVM, FCode), and as languages
for human programmers (e.g., Forth, PostScript). How... / the programs into standard compiler data structures then br structures then state-of-the-art compiler technology can be applied for
3041.3 Compiler Architectures for Heterogeneous Systems - McKinley, Singhai, Weaver, Weems (1995)(Correct)
Heterogeneous parallel systems incorporate diverse models of parallelism within a single machine or across machines and are better suited for diverse applications [25, 43, 30]. These systems are alr... / Compiler Architectures for Heterogeneous br development. We believe that compilers can and should assist in
3038.8 Comparing Static and Dynamic Scheduling on Superscalar Processors - Lo (1995)(Correct)
This paper will examine various static and dynamic scheduling techniques and evaluate the two approaches,
Page 2 unknown Page 1
Comparing Static and Dynamic Scheduling on Superscalar Processors
Ja... / pushed into software. Most modern compilers provide instruction scheduling br and Impact CMCWH compilers are examples of software
3018.5 Memory Forwarding: Enabling Aggressive Data Layout Optimizations by.. - Todd Mowry(Correct)
Recent studies have shown that caches are not as effective as expected due to the insufficient reuse of
cached data. One promising approach to increasing data reuse is to lay out data in a more cache-... / safety with current hardware or compiler technology. To help fully br Performance Attributes D. . Compilers Introduction As the gap
3017.3 An Empirical Study of Precise Interprocedural Array Analysis - Hind, Burke, Carini, Midkiff (1994)(Correct)
In this paper we examine the role played by the interprocedural
analysis of array accesses in the automatic
parallelization of Fortran programs. We
use the ptran system to provide measurements of
seve... / program parallelization like any compiler optimization can benefit from br Background Traditionally compilers have processed programs at the
3015.1 Static Analysis of Upper and Lower Bounds on Dependences and.. - William Pugh (1993)(Correct)
Existing compilers often fail to parallelize sequential code, even when a program can be manually
transformed into parallel form by a sequence of well-understood transformations (as is the
case for ma... / MD Abstract Existing compilers often fail to parallelize br transformations implemented in the compiler may not be sufficient to produce
3012.3 Compiling Standard ML to Java - Gammage (1997)(Correct)
The phenomenal recent success of the Java programming language stands in stark contrast
to the reluctance with which other new languages have been greeted in industry. Java's
popularity can be attribu... / This document describes a compiler which dispenses with the Java br strategy. The result is a compiler which demonstrates both the
3003.4 Data Flow Analysis Across Tuplespace Process Boundaries - Fenwick, Jr., Pollock(Correct)
The increasing attention toward distributed shared memory systems attests to the fact that programmers find shared
memory parallel programming easier than message passing programming, while physically... / A current limitation of compilers for shared memory parallel br analysis remains quite viable in a compiler for shared memory parallel
2998.3 Value-Driven Redundancy Elimination - Simpson (1996)(Correct)
Value-driven redundancy elimination is a combination of value numbering and code
motion. Value numbering is an optimization that assigns numbers to values in such a
way that two values are assigned th... / assigned the same number if the compiler can prove they are equal. When br been part of the Massively Scalar Compiler Project at Rice University. The
2996.9 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
2995.7 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
2964.5 Evaluating Compiler Optimizations For Fortran D - Hiranandani, Kennedy, Tseng (1994)(Correct)
The Fortran D compiler uses data decomposition specifications to automatically translate Fortran
programs for execution on MIMD distributed-memory machines. This paper introduces and
classifies a numb... / Evaluating Compiler Optimizations For Fortran D br Foundation. Evaluating Compiler Optimizations For Fortran D
2962.8 Hardware Support for Dynamic Access Ordering: Performance of Some.. - McKee (1993)(Correct)
Hardware Support for Dynamic Access Ordering:
Performance of Some Design Options
Sally A. McKee
Department of Computer Science
University of Virginia
Charlottesville, VA, 22903
mckee@virginia.edu
Mem... / only available at run time the compiler can't generate the optimal access br sequence. The extent to which a compiler can perform this optimization is
2958.6 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
2955.8 Advanced Code Generation for High Performance Fortran - Adve, Mellor-Crummey(Correct)
this paper, we describe
techniques developed in the Rice dHPF compiler to address key code generation
challenges that arise in achieving high performance for regular applications on
message-passing sy... / wide acceptance parallelizing compilers must be able to provide br studied current state-of-the-art compilers implement only a small number
2946.8 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
2946.0 A Quantitative Analysis of Loop Nest Locality - McKinley, Temam (1996)(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
2936.3 TIL: A Type-Directed Optimizing Compiler for ML - Tarditi, Morrisett, Cheng (1995)(Correct)
We describe a new compiler for Standard ML called TIL, that is based on four technologies: intensional
polymorphism, tag-free garbage collection, conventional functional language optimization,
and loo... / TIL A Type-Directed Optimizing Compiler for ML David Tarditi Greg br Abstract We describe a new compiler for Standard ML called TIL that
2929.6 On the Analysis of PAMELA Models - van Gemund (1993)(Correct)
While last year's report [16] loosely introduced the general concepts behind the
Pamela approach toward modeling and analysis of parallel systems, this report
exclusively focuses on the calculus of t... / by both the user and the compiler. It also allows us to present a br profiling annotation or simply compiler defaults in cases where
2922.8 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
2922.2 Automatic Data Layout for Distributed-Memory Machines in the D.. - Kremer, Mellor-Crummey, Kennedy.. (1993)(Correct)
Although distributed-memory message-passing parallel computers are among the most cost effective high performance machines available, scientists find them extremely difficult to program. Most programm... / these annotations a sophisticated compiler can automatically transform a br Given a Fortran D program the compiler uses data layout directives to
2919.6 Optimizing Locality of Programs - Bodin, Kervella, O'Boyle(Correct)
This report describes an optimising compiler strategy for SVM systems. At present the
compiler uses a static data partitioning approach to parallelism exploitation. However,
internal compiler structur... / of Manchester Contents A Compiler Strategy for Shared Virtual br Shared Virtual Memories . A Compiler Strategy for SVM
2919.4 Semantics and compilation of sequential streams into a static SIMD.. - De Vito (1996)(Correct)
81/2 is a data-parallel language that relies on the notions of stream and collection in a
high-level declarative framework. We describe in this research report semantics and compilation
of sequential ... / of the clock of a stream makes the compiler able to check for consistencies br at compile-time allowing the compiler to ffl detect ill-typed
2918.1 Common Runtime Support for High Performance Languages (Final Report) - Fox (1998)(Correct)
this document reflect the shift towards Java as a primary focus
of investigation. At least three of the partners are now engaged in development of
parallel or optimizing Java compilers.
We intend to d... / . . Compiler Message Passing Interface . br . . Compilers .
2914.0 Cache Coherence Protocols for Large-Scale Multiprocessors - Chaiken (1990)(Correct)
Caches have the potential to provide multiprocessors with an automatic mechanism
for reducing both network traffic and average memory access latency. However, cachebased
systems must address the probl... / David Kranz wrote the Mul-T compiler which is the foundation of br the power and the limitations of compilers and run-time systems. Kirk
2882.5 Data Distribution Models and Algorithms - Appelbe, Doddapaneni, Hardnett(Correct)
Data distribution, and its interaction with parallelism and load
balancing, is the key unsolved problem for compiling for parallelism
for distributed memory computers. Many different techniques and al... / program a programmer or compiler must perform the following steps br data distribution and leave to a compiler the actual work of mapping
2873.8 Unified Compilation of Fortran 77D and 90D - Choudhary, Fox, Hiranandani.. (1993)(Correct)
this paper, we describe a unified strategy for compiling both Fortran 77D and Fortran 90D into efficient unknown Unified Compilation of Fortran 77D and 90D
ALOK CHOUDHARY*, GEOFFREY FOX*, SEEMA HIRANA... / machines. The integrated Fortran D compiler relies on two key observations. br Processors -code generation compilers optimization preprocessors
2864.1 Improving Software Pipelining with Unroll-and-Jam and Memory Reuse.. - Ding (1996)(Correct)
The high performance of today's microprocessors is achieved mainly by fast, multipleissuing
hardware and optimizing compilers that together exploit the instruction-level parallelism
(ILP) in programs.... / hardware and optimizing compilers that together exploit the br technique in today's ILP compilers. However four difficulties may
2863.8 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
2856.4 Type-Directed Partial Evaluation - Danvy (1996)(Correct)
We present a strikingly simple partial evaluator, that is typedirected
and reifies a compiled program into the text of a residual,
specialized program. Our partial evaluator is concise
(a few lines) a... / subtyping and coercions compiler optimization and run-time code br semantics-based compilation and compiler generation. Background and
2855.7 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
2851.1 Synchronization and Communication in the T3E Multiprocessor - Scott (1996)(Correct)
This paper describes the synchronization and communication primitives of the Cray T3E multiprocessor, a shared memory system scalable to 2048 processors. We discuss what we have learned from the T3D p... / significantly easier for the compiler. For either programming model br queue is used by both the CRAFT compiler to fetch remote data in loops
2818.5 Effective Specialization of Realistic Programs via Use Sensitivity - Hornof, Consel, Noyé (1997)(Correct)
In order to exploit specialization opportunities that exist
in programs written by researchers outside of the
programming language community, a partial evaluator
needs to effectively treat existing re... / it to various problems such as compiler generation br Ultimately just like a compiler a partial evaluator is a tool.
2798.8 Type-Checking and Type-Inference for Object-Oriented Programming.. - Graver (1989)(Correct)
Type systems for object-oriented programming languages have been studied a great deal over the
past few years. Since Smalltalk was one of the earliest object-oriented languages, it is not surprising
t... / TS Typed Smalltalk optimizing compiler. iii Acknowledgements I br TS Typed Smalltalk optimizing compiler JGZ . The Whats Whys
2791.0 HPFIT: A Set of Integrated Tools for the Parallelization of.. - Brandes, Chaumette, Counilh, Darte.. (1996)(Correct)
In this report, we present the HPFIT project whose aim is to provide a set of interactive
tools integrated in a single environment to help users to parallelize scientific applications to be
run on d... / code. The user needs to help the compiler by giving information about his br analysis tool the Fortran D compiler and tools for automatic data
2771.3 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
2770.1 Towards Identifying and Monitoring Optimization Impacts - Way, Pollock (1997)(Correct)
Optimizing compilers apply code-improving transformations
in phases over a source program in an effort to
emit the fastest or most compact executable code possible.
The effectiveness of these optimiza... / Abstract Optimizing compilers apply code-improving br of a tunable optimizing compiler for ILP architectures are
2745.5 Data and Computation Transformations for Multiprocessors - Anderson (1995)(Correct)
Effective memory hierarchy utilization is critical to the performance of modern multiprocessor architectures. We havedeveloped the first compiler system that fully automatically parallelizes sequentia... / We havedeveloped the first compiler system that fully automatically br framework. We ran our compiler on a set of application programs
2740.8 Evaluation of Compiler Optimizations for Fortran D on MIMD.. - Hiranandani, Kennedy, Tseng (1992)(Correct)
The Fortran D compiler uses data decomposition specifications
to automatically translate Fortran programs for execution
on MIMD distributed-memory machines. This paper
introduces and classifies a numb... / Evaluation of Compiler Optimizations for Fortran D on br DC July . Evaluation of Compiler Optimizations for Fortran D on
2706.7 Dynamic Feedback: An Effective Technique for Adaptive Computing - Diniz, Rinard (1997)(Correct)
This paper presents dynamic feedback, a technique that enables
computations to adapt dynamically to different execution environments.
A compiler that uses dynamic feedback produces several
different v... / execution environments. A compiler that uses dynamic feedback br in the context of a parallelizing compiler for object-based programs. The
2705.8 SPAID: Software Prefetching in Pointer- and Call-Intensive.. - Lipasti, Schmidt, Kunkel, Roediger (1995)(Correct)
Software prefetching, typically in the context of numericor
loop-intensive benchmarks, has been proposed as one
remedy for the performance bottleneck imposed on computer
systems by the cost of servici... / upon the designers of optimizing compilers to find ways to utilize br of code sections by the compiler both at the basic block level
2695.9 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 .
2691.6 Compiler Blockability of Dense Matrix Factorizations - Carr, Lehoucq (1997)(Correct)
The goal of the LAPACK project is to provide efficient and portable software for dense
numerical linear algebra computations. By recasting many of the fundamental dense matrix
computations in terms of... / Compiler Blockability of Dense Matrix br and should be performed by the compiler. We believe that it is better
2683.3 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
2682.3 Realistic Compilation by Partial Evaluation - Sperber, Thiemann (1996)(Correct)
Two key steps in the compilation of strict functional languages are the conversion of higher-order functions to data structures (clo- sures) and the transformation to tail-recursive style. We show how... / that of other modern Scheme-to-C compilers. In addition we have integrated br an instance of semantics-directed compiler generation. Keywords
2674.5 A Generalized Theory of Linear Loop Transformations - Kulkarni, Stumm, Unrau, Li (1994)(Correct)
In this paper we present a new theory of linear loop transformations called Computation Decomposition
and Alignment (CDA). A CDA transformation has two components: Computation Decomposition first deco... / it easier for later stages of the compiler to optimize processor pipelines. br SWM with IBM's prototype HPF compiler. The data were distributed by
2658.6 Application Generators - Smaragdakis, Batory(Correct)
Introduction
When a programming activity is well-understood, it can be automated. Automation transforms software development from
activities like rote coding and tedious debugging to that of specific... / Application generators are compilers for domain-specific programming br software etc. Although all compilers can be viewed as generators
2648.5 Compiling for Shared-Memory and Message-Passing Computer - Larus (1994)(Correct)
Many parallel languages presume a shared address space in which any portion
of a computation can access any datum. Some parallel computers directly support
this abstraction with hardware shared memory... / there is considerable interest in compiler support for shared address spaces br This paper argues however that compiler-implemented shared memory
2647.8 Emerald: A General-Purpose Programming Language - Raj, Tempero, Levy, Black, al. (1991)(Correct)
data types, Inheritance, Object-based concurrency
1. INTRODUCTION
Emerald
1; 2
is a strongly-typed programming language that supports an atypical variant of the objectoriented
paradigm. Although o... / implementation of the Emerald compiler. As part of its execution the br As part of its execution the compiler creates a parse tree whose nodes
2630.6 CoD3 Optimizing Locality Of Programs Apparc Deliverable - Bodin, Jalby, Seznec, O'Boyle..(Correct)
this report we investigate the window concept developed in deliverable CoD2 and its
application to programs on monoprocessor architectures having a memory cache. Program
transformations and cache orga... / Contents Introduction Compiler Infrastructure . Using br to catch statically by the compiler and one of the most
2627.9 HPFBench: A High Performance Fortran Benchmark Suite - Hu, Jin, Johnsson, Kehagias, Shalaby(Correct)
The High Performance Fortran (HPF) benchmark suite HPFBench is designed for evaluating
the HPF language and compilers on scalable architectures. The functionality of the benchmarks
cover scientific so... / evaluating the HPF language and compilers on scalable architectures. The br particular aspects of an HPF compiler. Furthermore we report
2626.4 Compiling Fortran D for MIMD Distributed-Memory Machines - Hiranandani (1992)(Correct)
Fortran D, a version of Fortran extended with
data decomposition specifications, is designed to provide
a machine-independent data-parallel programming
model. This paper describes analysis, optimizati... / employed in the Fortran D compiler. The compiler first partitions br in the Fortran D compiler. The compiler first partitions programs using
2611.3 CHAOS++: A Runtime Library for Supporting Distributed Dynamic Data.. - Chialin Chang(Correct)
Traditionally, applications executed on distributed memory architectures in single-program
multiple-data (SPMD) mode use distributed (multi-dimensional) data arrays. Good performance
has been achieved... / that can be carried out by compilers are thus limited and runtime br no special support from Ccompilers. Currently CHAOSuses
2610.8 Demand Interprocedural Program Analysis Using Logic Databases - Reps (1994)(Correct)
This paper describes how algorithms for demand versions of inerprocedural programanalysis
problems can be obtained from their exhaustive counterparts essentially for
free, by applying the so-called ma... / Fifth International Conference on Compiler Construction br Fourth International Conference on Compiler Construction pages -
2602.7 A Selective Caching Technique - John, Radhakrishnan(Correct)
Efficient caches are extremely important for achieving good performance from modern high
performance processors. Conventional cache architectures exploit locality, but do so rather
blindly. Since all ... / elements designated by the compiler. In this paper we present the br instructions designated by the compiler. Although such features are not
2599.6 ALPHA: A family of structured intermediate representations for a.. - Hendren, Gao, Sreedhar (1992)(Correct)
The design of intermediate languages plays a crucial role in the development of optimizing and
parallelizing compilers. In this paper, we present the design of ALPHA, a Hybrid Executable Intermediate
... / ACAPS Laboratory Advanced Compilers Architectures and Parallel br for a Parallelizing C Compiler Laurie J. Hendren Guang R.
2597.5 The Spectrum Of Thread Implementations On Hybrid Multithreaded.. - Shankar (1995)(Correct)
OF DISSERTATION
THE SPECTRUM OF THREAD IMPLEMENTATIONS ON HYBRID
MULTITHREADED ARCHITECTURES
The proliferation of multithreaded architectures indicates a desire to combine the best
of the dataflow and... / architectures and capable compilers a possible platform for br challenge is to design efficient compilers for mapping applicative
2591.5 ICC++ - A C++ Dialect for High Performance Parallel Computing - Chien, Reddy, Plevyak, Dolby (1996)(Correct)
ICC++ is a new C++ concurrent dialect which allows sequential/parallel program versions
to be maintained with single source, the construction of concurrent data abstractions, convenient
expression of ... / must be designed with modern compiler optimization techniques in mind. br for concurrency and for effective compiler analysis. We believe that for a
2586.2 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.
2585.2 The Subspace Model: Shape-based Compilation for Parallel Systems - Knobe (1997)(Correct)
Subspace analysis is a target independent parallel compilation technique. It applies
to a wide range of parallel architectures including vector, SIMD, distributed memory
MIMD, shared memory MIMD, symm... / benefits to this approach The compiler for a given target is simpler br a more significant portion of the compiler is independent of the parallel
2580.4 An Overview of the Opus Language and Runtime System - Piyush Mehrotra (1994)(Correct)
We have recently introduced a new language, called Opus, which provides a set of Fortran language
extensions that allow for integrated support of task and data parallelism. It also provides
shared dat... / In the latter case the compiler will generate the appropriate br Opus Runtime Opus Language Compiler Language-dependent Runtime
2562.1 Improving the Parallelism and Concurrency in Decoupled Architectures - K.J., Naresh.C(Correct)
This paper investigates a technique to facilitate anticipatory loading to queues even in presence of data dependent control dependencies. The proposed method consists of fetching along one or both pat... / unnecessarily fetched data. The compiler hoists load instructions above br Access-execute decoupling compiler optimization load hoisting code
2557.6 Memory-Hierarchy Management - Carr (1992)(Correct)
The trend in high-performance microprocessor design is toward increasing computational power on the
chip. Microprocessors can now process dramatically more data per machine cycle than previous models.... / is a step in the wrong direction. Compilers not programmers should handle br develops and experiments with compiler algorithms that manage the memory
2557.5 Evaluating High Level Parallel Programming Support for Irregular.. - Chien, Dolby, Ganguly, Karamcheti..(Correct)
Object-oriented techniques have been proffered as aids for managing complexity, enhancing reuse, and
improving readability of irregular parallel applications. However, as performance is the major reas... / is automatically managed by the compiler and runtime but in general br Concert system a high performance compiler and runtime for parallel
2552.2 Compiler Technology for Parallel Scientific Computation - Can Ozturan (1994)(Correct)
There is a need for compiler technology that, given the source program, will generate efficient parallel
codes for different architectures with minimal user involvement. Parallel computation is becomi... / in Scientific Programming Compiler Technology for Parallel br Abstract There is a need for compiler technology that given the source
2549.7 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
2527.3 Expressing Object Residency Optimizations Using Pointer Type.. - Eliot Moss (1994)(Correct)
We consider some issues in optimizing persistent programming languages. In particular,
we show how to express optimizations of object residency checks in strongly
typed persistent languages as "annota... / by the language implementation compiler plus run time Second we can br from the remainder of the compiler which simply obeys them. This
2525.0 Performance Characterization of Optimizing Compilers - Saavedra, Smith (1992)(Correct)
Optimizing compilers have become an essential component in
achieving high levels of performance. Various simple and sophisticated
optimizations are implemented at different stages of compilation to yi... / Characterization of Optimizing Compilers USC-CS- - Rafael H. br Characterization of Optimizing Compilers Rafael H. Saavedra
2515.4 Distributed Memory Compiler Design for Sparse Problems - Wu (1995)(Correct)
This paper addresses the issue of compiling concurrent loop nests in the presence of complicated
array references and irregularly distributed arrays. Arrays accessed within loops
may contain accesses ... / Distributed Memory Compiler Design for Sparse Problems br that is used effectively by a compiler to generate efficient code in
2506.6 Static Integrity Constraint Management in Object-Oriented Database.. - Benzaken, Schaefer (1996)(Correct)
In this paper, we propose an efficient technique to statically manage integrity constraints in object-oriented database
programming languages. We place ourselves in the context of an extended version ... / this technique is embedded in the compiler technology thus no human br each update. Despite the several optimization techniques that have been
2503.9 `C: A Language for High-Level, Efficient, and Machine-Independent.. - Dawson Engler (1996)(Correct)
Dynamic code generation allows specialized code sequences
to be created using runtime information. Since this information
is by definition not available statically, the use of dynamic code
generation ... / use. Experiments with a prototype compiler show that C enables excellent br contribution is a prototype C compiler. This compiler demonstrates that
2498.9 A Genetic Algorithm (GA) Shell for Iterative Timetabling - Chan (1994)(Correct)
We present a new approach to timetabling which is a typical Constraints Satisfaction
Problem. The new approach is based on an iterative scheduling model equipped
with a generic Genetic Algorithm (GA) ... / language the corresponding compiler a user interface and a br the job of the constraint compiler. . . Generic fitness
2487.1 Loop Parallelization Algorithms - Darte, Robert, Vivien(Correct)
this paper:
Example 7.1 unknown Loop Parallelization Algorithms
Alain Darte, Yves Robert and Fr'ed'eric Vivien
LIP, Ecole Normale Sup'erieure de Lyon, F - 69364 LYON Cedex 07, France
e-mail: [Alain... / as it provides guidance for a compiler-parallelizer given the br in the field of parallelizing compilers other examples are general task
2485.1 Enhancing Instruction Level Parallelism Through Compiler-Controlled.. - Bringmann (1995)(Correct)
this paper. In an effort to be more concise, the results presented
in the subsequent figures are generated by computing the arithmetic mean of speedups for each
speculation model, cache size and issue... / Level Parallelism Through Compiler-Controlled Speculation By Roger br Level Parallelism Through Compiler-Controlled Speculation Roger
2483.0 Increasing Memory Bandwidth for Vector Computations - McKee, Moyer, Wulf, Hitchcock (1993)(Correct)
Memory bandwidth is rapidly becoming the performance bottleneck
in the application of high performance microprocessors to vector-like algorithms,
including the "Grand Challenge" scientific problems.... / be vectorized. Nonetheless the compiler can employ the recurrence br only available at run time the compiler can't generate the optimal
2480.9 Unifying Data and Control Transformations for Distributed.. - Cierniak, Li (1994)(Correct)
We present a unified approach to locality optimization that employs both data and control transformations. Data transformations include changing the array layout in memory. Control transformations inv... / have developed new techniques for compiler optimizations for distributed br with a memory hierarchy. Our compiler optimizations are based on an