POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATION

The polyhedral model for loop parallelization has proved to be an effective tool for advanced optimization and automatic parallelization of programs in higher-level languages. Yet, to integrate such optimizations seamlessly into production compilers, they must be performed on the compiler's int...

Full description

Saved in:
Bibliographic Details
Published inParallel processing letters Vol. 22; no. 4; p. 1250010
Main Authors GROSSER, TOBIAS, GROESSLINGER, ARMIN, LENGAUER, CHRISTIAN
Format Journal Article
LanguageEnglish
Published World Scientific Publishing Company 01.12.2012
Subjects
Online AccessGet full text
ISSN0129-6264
1793-642X
DOI10.1142/S0129626412500107

Cover

More Information
Summary:The polyhedral model for loop parallelization has proved to be an effective tool for advanced optimization and automatic parallelization of programs in higher-level languages. Yet, to integrate such optimizations seamlessly into production compilers, they must be performed on the compiler's internal, low-level, intermediate representation (IR). With Polly, we present an infrastructure for polyhedral optimizations on such an IR. We describe the detection of program parts amenable to a polyhedral optimization (so-called static control parts), their translation to a Z-polyhedral representation, optimizations on this representation and the generation of optimized IR code. Furthermore, we define an interface for connecting external optimizers and present a novel way of using the parallelism they introduce to generate SIMD and OpenMP code. To evaluate Polly, we compile the PolyBench 2.0 benchmarks fully automatically with PLuTo as external optimizer and parallelizer. We can report on significant speedups.
ISSN:0129-6264
1793-642X
DOI:10.1142/S0129626412500107