Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
A Framework for Unrestricted Whole-Program Optimization Spyridon Triantafyllis Matthew J. Bridges Easwaran Raman Guilherme Ottoni David I. August
 

Summary: A Framework for Unrestricted Whole-Program Optimization
Spyridon Triantafyllis Matthew J. Bridges Easwaran Raman Guilherme Ottoni David I. August
Department of Computer Science
Princeton University
{strianta,mbridges,eraman,ottoni,august}@princeton.edu
Abstract
Procedures have long been the basic units of compilation in con-
ventional optimization frameworks. However, procedures are typi-
cally formed to serve software engineering rather than optimization
goals, arbitrarily constraining code transformations. Techniques,
such as aggressive inlining and interprocedural optimization, have
been developed to alleviate this problem, but, due to code growth
and compile time issues, these can be applied only sparingly.
This paper introduces the Procedure Boundary Elimination (PBE)
compilation framework, which allows unrestricted whole-program
optimization. PBE allows all intra-procedural optimizations and
analyses to operate on arbitrary subgraphs of the program, regard-
less of the original procedure boundaries and without resorting to
inlining. In order to control compilation time, PBE also introduces
novel extensions of region formation and encapsulation. PBE en-

  

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

 

Collections: Computer Technologies and Information Sciences