Personal tools
You are here: Home Publications Adaptive Optimizing Compilers for the 21st Century
Document Actions

Keith D Cooper, Devika Subramanian, and Linda Torczon (2001)

Adaptive Optimizing Compilers for the 21st Century

The Journal of Supercomputing, Volume 23(1):pp. 7 - 22.

Historically, compilers have operated by applying a fixed set of optimizations in a predetermined order. We call such an ordered list of optimizations a compilation sequence. This paper describes a prototype system that uses biased random search to discover a program-specific compilation sequence that minimizes an explicit, external objective function. The result is a compiler framework that adapts its behavior to the application being compiled, to the pool of available transformations, to the objective function, and to the target machine. This paper describes experiments that attempt to characterize the space that the adaptive compiler must search. The preliminary results suggest that optimal solutions are rare and that local minima are frequent. If this holds true, biased random searches, such as a genetic algorithm, should find good solutions more quickly than simpler strategies, such as hill climbing.

Also appeared in the Proceedings of the LACSI Symposium 2001, published on CD-ROM.
by admin last modified 2007-12-10 21:06
« August 2010 »
Su Mo Tu We Th Fr Sa
1234567
891011121314
15161718192021
22232425262728
293031
 

Powered by Plone

LACSI Collaborators include:

Rice University LANL UH UNM UIUC UNC UTK