Loop Transformations: Convexity, Pruning and Optimization - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2011

Loop Transformations: Convexity, Pruning and Optimization


High-level loop transformations are a key instrument in mapping computational kernels to effectively exploit resources in modern processor architectures. However, determining appropriate compositions of loop transformations to achieve this remains a significantly challenging task; current compilers may achieve significantly lower performance than hand-optimized programs. To address this fundamental challenge, we first present a convex characterization of all distinct, semantics-preserving, multidimensional affine transformations. We then bring together algebraic, algorithmic, and performance analysis results to design a tractable optimization algorithm over this highly expressive space. The framework has been implemented and validated experimentally on a representative set of benchmarks run on state-of-the-art multi-core platforms.
Fichier principal
Vignette du fichier
PBBCRSV11-POPL.pdf (354.99 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

inria-00551077 , version 1 (02-01-2011)


  • HAL Id : inria-00551077 , version 1


Louis-Noël Pouchet, Uday Bondhugula, Cédric Bastoul, Albert Cohen, Jagannathan Ramanujam, et al.. Loop Transformations: Convexity, Pruning and Optimization. 38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'11), Jan 2011, Austin, TX, United States. ⟨inria-00551077⟩
161 View
716 Download


Gmail Facebook Twitter LinkedIn More