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

Konrad Trifunovic, Albert Cohen, David Edelsohn, Feng Li, Tobias Grosser, Harsha Jagasia, Razya Ladelsky, Sebastian Pop, Jan Sjödin, Ramakrishna Upadrasta

Research output: Contribution to conferencePaperpeer-review


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.
Original languageEnglish
Number of pages16
Publication statusPublished - 23 Jan 2010
Event2nd Workshop on GCC Research Opportunities - Pisa, Italy
Duration: 23 Jan 201023 Jan 2010


Workshop2nd Workshop on GCC Research Opportunities
Abbreviated titleGROW 2010
Internet address


Dive into the research topics of 'GRAPHITE Two Years After: First Lessons Learned From Real-World Polyhedral Compilation'. Together they form a unique fingerprint.

Cite this