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.
|Number of pages||16|
|Publication status||Published - 23 Jan 2010|
|Event||2nd Workshop on GCC Research Opportunities - Pisa, Italy|
Duration: 23 Jan 2010 → 23 Jan 2010
|Workshop||2nd Workshop on GCC Research Opportunities|
|Abbreviated title||GROW 2010|
|Period||23/01/10 → 23/01/10|