The sparse polyhedral framework: Composing compiler-generated inspector-executor code

MM Strout, M Hall, C Olschanowsky - Proceedings of the IEEE, 2018 - ieeexplore.ieee.org
Irregular applications such as big graph analysis, material simulations, molecular dynamics
simulations, and finite element analysis have performance problems due to their use of …

Polly—performing polyhedral optimizations on a low-level intermediate representation

T Grosser, A Groesslinger, C Lengauer - Parallel Processing Letters, 2012 - World Scientific
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 …

A practical automatic polyhedral parallelizer and locality optimizer

U Bondhugula, A Hartono, J Ramanujam… - Proceedings of the 29th …, 2008 - dl.acm.org
We present the design and implementation of an automatic polyhedral source-to-source
transformation framework that can optimize regular programs (sequences of possibly …

Automatic transformations for communication-minimized parallelization and locality optimization in the polyhedral model

U Bondhugula, M Baskaran, S Krishnamoorthy… - … CC 2008, Held as Part of …, 2008 - Springer
The polyhedral model provides powerful abstractions to optimize loop nests with regular
accesses. Affine transformations in this model capture a complex sequence of execution …

[PDF][PDF] Pluto: A practical and fully automatic polyhedral program optimization system

U Bondhugula, A Hartono, J Ramanujam… - Proceedings of the …, 2008 - researchgate.net
We present the design and implementation of a fully automatic polyhedral source-to-source
transformation framework that can optimize regular programs (sequences of possibly …

Tiling stencil computations to maximize parallelism

V Bandishti, I Pananilath… - SC'12: Proceedings of …, 2012 - ieeexplore.ieee.org
Most stencil computations allow tile-wise concurrent start, ie, there always exists a face of
the iteration space and a set of tiling hyperplanes such that all tiles along that face can be …

Predictive modeling in a polyhedral optimization space

E Park, J Cavazos, LN Pouchet, C Bastoul… - International journal of …, 2013 - Springer
High-level program optimizations, such as loop transformations, are critical for high
performance on multi-core targets. However, complex sequences of loop transformations …

Polyhedral AST generation is more than scanning polyhedra

T Grosser, S Verdoolaege, A Cohen - ACM Transactions on …, 2015 - dl.acm.org
Abstract mathematical representations such as integer polyhedra have been shown to be
useful to precisely analyze computational kernels and to express complex loop …

Compile-time composition of run-time data and iteration reorderings

MM Strout, L Carter, J Ferrante - Proceedings of the ACM SIGPLAN 2003 …, 2003 - dl.acm.org
Many important applications, such as those using sparse data structures, have memory
reference patterns that are unknown at compile-time. Prior work has developed run-time …

The pluto+ algorithm: A practical approach for parallelization and locality optimization of affine loop nests

U Bondhugula, A Acharya, A Cohen - ACM Transactions on …, 2016 - dl.acm.org
Affine transformations have proven to be powerful for loop restructuring due to their ability to
model a very wide range of transformations. A single multidimensional affine function can …