PLuTo: A Practical and Fully Automatic Polyhedral Program Optimization System

Abstract

We present the design and implementation of a fully automatic polyhedral source-to-source transformation framework that can optimize regular programs (sequences of possibly imperfectly nested loops) for parallelism and locality simultaneously. Through this work, we show the practicality of analytical model-driven automatic transformation in the polyhedral model – far beyond what is possible by current production compilers. Unlike previous works, our approach is an end-to-end fully automatic one driven by an integer linear optimization framework that takes an explicit view of finding good ways of tiling for parallelism and locality using affine transformations. We also address generation of tiled code for multiple statement domains of arbitrary dimensionalities under (statement-wise) affine transformations – an issue that has not been addressed previously. Experimental results from the implemented system show very high speedups for local and parallel execution on multi-cores over state-of-the-art compiler frameworks from the research community as well as the best native compilers. The system also enables the easy use of powerful empirical/iterative optimization for general arbitrarily nested loop sequences.

Extracted Key Phrases

15 Figures and Tables

01020200920102011201220132014201520162017
Citations per Year

79 Citations

Semantic Scholar estimates that this publication has 79 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@inproceedings{Bondhugula2007PLuToAP, title={PLuTo: A Practical and Fully Automatic Polyhedral Program Optimization System}, author={Uday Bondhugula and J. Ramanujam and P. Sadayappan}, year={2007} }