GRAPHITE Two Years After: First Lessons Learned From Real-World Polyhedral Compilation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2010

GRAPHITE Two Years After: First Lessons Learned From Real-World Polyhedral Compilation

Abstract

Modern compilers are responsible for adapting the semantics of source programs into a form that makes efficient use of a highly complex, heterogeneous machine. This adaptation amounts to solve an optimization problem in a huge and unstructured search space, while predicting the performance outcome of complex sequences of program transformations. The polyhedral model of compilation is aimed at these challenges. Its geometrical, non-inductive semantics enables the construction of better-structured optimization problems and precise analytical models. Recent work demonstrated the scalability of the main polyhedral algorithms to real-world programs. Its integration into production compilers is under way, pioneered by the Graphite branch of the GNU Compiler Collection (GCC). Two years after the effective beginning of the project, this paper reports on original questions and innovative solutions that arose during the design and implementation of Graphite.
Fichier principal
Vignette du fichier
main.pdf (208.15 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00551516 , version 1 (04-01-2011)

Identifiers

  • HAL Id : inria-00551516 , version 1

Cite

Konrad Trifunovic, Albert Cohen, David Edelsohn, Feng Li, Tobias Grosser, et al.. GRAPHITE Two Years After: First Lessons Learned From Real-World Polyhedral Compilation. GCC Research Opportunities Workshop (GROW'10), Jan 2010, Pisa, Italy. ⟨inria-00551516⟩
809 View
628 Download

Share

Gmail Facebook X LinkedIn More