Dissemin is shutting down on January 1st, 2025

Published in

World Scientific Publishing, Parallel Processing Letters, 04(22), p. 1250010

DOI: 10.1142/s0129626412500107

Links

Tools

Export citation

Search in Google Scholar

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

Journal article published in 2012 by Tobias Grosser ORCID, Armin Groesslinger, Christian Lengauer
This paper was not found in any repository, but could be made available legally by the author.
This paper was not found in any repository, but could be made available legally by the author.

Full text: Unavailable

Green circle
Preprint: archiving allowed
Green circle
Postprint: archiving allowed
Red circle
Published version: archiving forbidden
Data provided by SHERPA/RoMEO

Abstract

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.