Exploring the structure of the space of compilation sequences using randomized search algorithms | 21 | 1.99 | 2006 |
ACME: adaptive compilation made efficient | 49 | 2.68 | 2005 |
Finding effective compilation sequences | 59 | 4.09 | 2004 |
Toward a framework for preparing and executing adaptive grid programs | 64 | 4.55 | 2002 |
Adaptive Optimizing Compilers for the 21st Century | 92 | 5.11 | 2002 |
The GrADS Project: Software Support for High-Level Grid Application Development | 204 | 15.28 | 2001 |
Telescoping Languages: A Strategy for Automatic Generation of Scientific Problem-Solving Systems from Annotated Libraries | 36 | 3.06 | 2001 |
How to build an interference graph | 4 | 0.70 | 1998 |
Improvements to graph coloring register allocation | 211 | 17.48 | 1994 |
An efficient representation for sparse sets | 43 | 2.79 | 1993 |
Interprocedural optimization: eliminating unnecessary recompilation | 28 | 7.00 | 1993 |
Interprocedural constant propagation: a study of jump function implementation | 38 | 4.88 | 1993 |
Coloring register pairs | 11 | 1.59 | 1992 |
Unexpected side effects of inline substitution: a case study | 18 | 2.65 | 1992 |
An experiment with inline substitution | 34 | 6.62 | 1991 |
Coloring heuristics for register allocation (with retrospective) | 0 | 0.34 | 1989 |
A Practical Environment for Scientific Programming | 15 | 5.04 | 1987 |
Parallel programming support in ParaScope | 6 | 4.33 | 1987 |
The impact of interprocedural analysis and optimization in the Rn programming environment | 34 | 11.29 | 1986 |
Interprocedural optimization: eliminating unnecessary recompilation | 1 | 0.35 | 1986 |
Interprocedural optimization: eliminating unnecessary recompilation | 41 | 8.42 | 1986 |
Interprocedural constant propagation | 79 | 32.53 | 1986 |
Editing and compiling whole programs | 8 | 3.22 | 1986 |
Interprocedural constant propagation (with retrospective) | 0 | 0.34 | 1986 |