Graphite two years after: First lessons learned from real-world polyhedral compilation

  • Konrad Trifunovic
  • Albert Cohen
  • David Edelsohn
  • Li Feng
  • Tobias Grosser
  • Harsha Jagasia Razya Ladelsky
ORKG logo Add to ORKG
Publication date
January 2010

Abstract

Abstract. Modern compilers are responsible for adapting the semantics of source programs into a form that makes efficient use of a highly complex, hetero-geneous 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 com-pilation is aimed at these challenges. Its geometrical, non-inductive semantics enables the construction of better-structured optimization problems and pre-cise 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 br...

Extracted data

Loading...

Related items

GRAPHITE Two Years After: First Lessons Learned From Real-World Polyhedral Compilation
  • Trifunovic, Konrad
  • Cohen, Albert
  • Edelsohn, David
  • Li, Feng
  • Grosser, Tobias
  • Jagasia, Harsha
  • Ladelsky, Razya
  • Pop, Sebastian
  • Sjödin, Jan
  • Upadrasta, Ramakrishna
January 2010

International audienceModern compilers are responsible for adapting the semantics of source programs...

Optimization opportunities based on the polyhedral model in GRAPHITE How much impact has GRAPHITE already? Tobias
January 2016

The polytope model is used since many years to describe standard loop optimizations like blocking, i...

Design of graphite and the Polyhedral Compilation Package
  • Sjödin, Jan
  • Pop, Sebastian
  • Jagasia, Harsha
  • Grosser, Tobias
  • Pop, Antoniu
June 2009

Graphite is the loop transformation framework that was introduced in GCC 4.4. This paper gives a det...

We use cookies to provide a better user experience.