Opening book details…
Can I read Finding Effective Compilation Sequences on EtoBox?
Finding Effective Compilation Sequences by L. Almagor; Keith D. Cooper; Alexander Grosul; Timothy J. Harvey; Steven W. Reeves; Devika Subramanian; Linda Torczon; Todd Waterman is a Computer Science article available to read on EtoBox.
What is Finding Effective Compilation Sequences about?
Most modern compilers operate by applying a fixed, program-independent sequence of optimizations to all programs. Compiler writers choose a single "compilation sequence", or perhaps a couple of compilation sequences. In choosing a sequence, they may consider performance of benchmarks or other important codes. These sequences are intended as general-purpose tools, accessible through command-line flags such as -O2 and -O3.Specific compilation sequences make a significant difference in the quality of the generated code, whether compiling for speed, for space, or for other metrics. A single universal compilation sequence does not produce the best results over all programs [8, 10, 29, 32]. Finding an optimal program-specific compilation sequence is difficult because the space of potential sequences is huge and the interactions between optimizations are poorly understood. Moreover, there is no systematic exploration of the costs and benefits of searching for good (i.e., within a certain percentage of optimal) program-specific compilation sequences.In this paper, we perform a large experimental study of the space of compilation sequences over a set of known benchmarks, using our prototype
Who reads Finding Effective Compilation Sequences?
It is typically read by researchers, students, and practitioners in Computer Science.
- Author
- L. Almagor; Keith D. Cooper; Alexander Grosul; Timothy J. Harvey; Steven W. Reeves; Devika Subramanian; Linda Torczon; Todd Waterman
- Publisher
- ACM
- Published
- 2004
- Language
- EN
- Field
- Computer Science (Physical Sciences)