Sciweavers

59 search results - page 6 / 12
» cc 2006
Sort
View
CC
2006
Springer
129views System Software» more  CC 2006»
15 years 1 months ago
Loop Transformations in the Ahead-of-Time Optimization of Java Bytecode
Abstract. Loop optimizations such as loop unrolling, unfolding and invariant code motion have long been used in a wide variety of compilers to improve the running time of applicati...
Simon Hammond, David Lacey
CC
2006
Springer
108views System Software» more  CC 2006»
14 years 9 months ago
Languages to diagonalize against advice classes
Variants of Kannan's Theorem are given where the circuits of the original theorem are replaced by arbitrary recursively presentable classes of languages that use advice string...
Chris Pollett
CC
2006
Springer
101views System Software» more  CC 2006»
15 years 1 months ago
SARA: Combining Stack Allocation and Register Allocation
Commonly-used memory units enable a processor to load and store multiple registers in one instruction. We showed in 2003 how to extend gcc with a stack-location-allocation (SLA) ph...
V. Krishna Nandivada, Jens Palsberg
CC
2006
Springer
15 years 1 months ago
Interprocedural Dataflow Analysis in the Presence of Large Libraries
Interprocedural dataflow analysis has a large number of uses for software optimization, maintenance, testing, and verification. For software built with reusable components, the tra...
Atanas Rountev, Scott Kagan, Thomas J. Marlowe
CC
2006
Springer
124views System Software» more  CC 2006»
15 years 1 months ago
Hybrid Optimizations: Which Optimization Algorithm to Use?
We introduce a new class of compiler heuristics: hybrid optimizations. Hybrid optimizations choose dynamically at compile time which optimization algorithm to apply from a set of d...
John Cavazos, J. Eliot B. Moss, Michael F. P. O'Bo...