Loop Transformations: Convexity, Pruning and Optimization

Abstract : 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.
Type de document :
Communication dans un congrès
38th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL'11), Jan 2011, Austin, TX, United States. 2011
Liste complète des métadonnées

Littérature citée [49 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00551077
Contributeur : Cédric Bastoul <>
Soumis le : dimanche 2 janvier 2011 - 14:27:23
Dernière modification le : vendredi 27 avril 2018 - 14:42:02
Document(s) archivé(s) le : dimanche 3 avril 2011 - 02:41:12

Fichier

PBBCRSV11-POPL.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00551077, version 1

Collections

Citation

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. 2011. 〈inria-00551077〉

Partager

Métriques

Consultations de la notice

362

Téléchargements de fichiers

269