POLLY — PERFORMING POLYHEDRAL OPTIMIZATIONS ON A LOW-LEVEL INTERMEDIATE REPRESENTATION
-
- TOBIAS GROSSER
- Parkas Group, Computer Science Department, École Normale Supérieure/INRIA, 45 Rue d'Ulm, Paris, 75005, France
-
- ARMIN GROESSLINGER
- Programming Group, Department of Informatics and Mathematics, University of Passau, Innstraße 33, Passau, 94032, Germany
-
- CHRISTIAN LENGAUER
- Programming Group, Department of Informatics and Mathematics, University of Passau, Innstraße 33, Passau, 94032, Germany
この論文をさがす
説明
<jats:p> 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. </jats:p>
収録刊行物
-
- Parallel Processing Letters
-
Parallel Processing Letters 22 (04), 1250010-, 2012-12
World Scientific Pub Co Pte Lt
