Skip to search formSkip to main contentSkip to account menu

Improvements to graph coloring register allocation

This paper describes two improvements to Chaitin-style graph coloring register allocators, and provides a detailed description of optimistic coloring and rematerialization, and presents experimental data to show the performance of several versions of the register allocator on a suite of FORTRAN programs.
View on ACM (opens in a new tab)

Optimizing for reduced code space using genetic algorithms

A genetic algorithm is used to find optimization sequences that generate small object codes that reduce code size and the idea of using different optimization sequences for different modules and functions of the same program is explored.
View on ACM (opens in a new tab)

New Grid Scheduling and Rescheduling Methods in the GrADS Project

This paper presents recent extensions to the GrADS software framework: a new approach to scheduling workflow computations, applied to a 3-D image reconstruction application; a simple stop/migrate/restart approach to rescheduling Grid applications, application to a QR factorization benchmark; and a process-swapping approach to Rescheduling, applications to an N-body simulation.
View on IEEE (opens in a new tab)

Engineering a Compiler

View via Publisher (opens in a new tab)

Finding effective compilation sequences

A large experimental study of the space of compilation sequences over a set of known benchmarks, using the prototype adaptive compiler to characterize these spaces and to determine if it is cost-effective to construct custom compilation sequences.
View on ACM (opens in a new tab)

Practical improvements to the construction and destruction of static single assignment form

This paper presents a meta-modelling system that automates the very labor-intensive and therefore time-heavy and expensive and therefore expensive and expensive process of computer programming called “hacking”.
View on Wiley (opens in a new tab)

The GrADS Project: Software Support for High-Level Grid Application Development

The goal of the Grid Application Development Software (GrADS) project is to simplify distributed heterogeneous computing in the same way that the World Wide Web simplified information sharing over the Internet.
View on SAGE (opens in a new tab)

Enhanced code compression for embedded RISC processors

This work focuses on reducing the size of a program's code segment, using pattern-matching techniques to identify and coalesce together repeated instruction sequences, and develops a new form of profile-driven code compression that reduces the speed penalty arising from compression.
View on ACM (opens in a new tab)

Effective partial redundancy elimination

This paper shows that a combination of global reassociation and global value numbering can increase the effectiveness of partial redundancy elimination by imposing a discipline on the choice of names and the shape of expressions.
View on ACM (opens in a new tab)

Adaptive Optimizing Compilers for the 21st Century

A prototype system that uses biased random search to discover a program-specific compilation sequence that minimizes an explicit, external objective function is described, which is a compiler framework that adapts its behavior to the application being compiled, to the pool of available transformations, toThe objective function, and to the target machine.
View on Springer (opens in a new tab)
...
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)