Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Compiler Optimization-Space Exploration Spyridon Triantafyllis Manish Vachharajani Neil Vachharajani David I. August
 

Summary: Compiler Optimization-Space Exploration
Spyridon Triantafyllis Manish Vachharajani Neil Vachharajani David I. August
Departments of Computer Science and Electrical Engineering
Princeton University
Princeton, NJ 08544
{strianta, manishv, nvachhar, august}@cs.princeton.edu
Abstract
To meet the demands of modern architectures, optimizing
compilers must incorporate an ever larger number of increas-
ingly complex transformation algorithms. Since code transfor-
mations may often degrade performance or interfere with sub-
sequent transformations, compilers employ predictive heuris-
tics to guide optimizations by predicting their effects a priori.
Unfortunately, the unpredictability of optimization interaction
and the irregularity of today's wide-issue machines severely
limit the accuracy of these heuristics. As a result, compiler
writers may temper high variance optimizations with overly
conservative heuristics or may exclude these optimizations en-
tirely. While this process results in a compiler capable of gen-
erating good average code quality across the target benchmark

  

Source: August, David - Department of Computer Science, Princeton University

 

Collections: Computer Technologies and Information Sciences