Adaptive Runtime Selection of Parallel Schedules in the Polytope Model

Benoit Pradelle 1, 2 Philippe Clauss 2, 1 Vincent Loechner 2, 1
2 CAMUS - Compilation pour les Architectures MUlti-coeurS
LSIIT - Laboratoire des Sciences de l'Image, de l'Informatique et de la Télédétection, Inria Nancy - Grand Est
Abstract : There is often no unique version of a program that provides the best performance in all circumstances. Compilers should rely on an adaptive runtime decision to choose which optimizing and parallelizing transformations will lead to the best performance in any execution context.We present a new adaptive framework solving two drawbacks of existing methods: it is effective since the very first execution, and it handles slight variations of input data shape and size. In our proposal, different code versions of parallel loop nests are statically generated by the compiler. At install time, each version is profiled in different execution contexts. At runtime, the execution time of each code version is predicted using the profiling results, the current input data shape and the number of available processor cores. The predicted best version is then run. Our framework handles several versions of possibly tiled parallel loops, using the polytope model for both the profiling and the dynamic selection phases. We show on several benchmark programs that our runtime system selects one of the most efficient version with a very low runtime overhead. This quick and efficient selection leads to speedups compared to the usage of a unique version in every execution context.
Type de document :
Communication dans un congrès
19th High Performance Computing Symposium - HPC 2011, Apr 2011, Boston, United States. ACM/SIGSIM, 2011
Liste complète des métadonnées

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

https://hal.inria.fr/inria-00564311
Contributeur : Philippe Clauss <>
Soumis le : vendredi 4 novembre 2011 - 10:12:09
Dernière modification le : vendredi 12 janvier 2018 - 01:11:10
Document(s) archivé(s) le : dimanche 5 février 2012 - 02:20:14

Fichier

papier.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00564311, version 1

Collections

Citation

Benoit Pradelle, Philippe Clauss, Vincent Loechner. Adaptive Runtime Selection of Parallel Schedules in the Polytope Model. 19th High Performance Computing Symposium - HPC 2011, Apr 2011, Boston, United States. ACM/SIGSIM, 2011. 〈inria-00564311〉

Partager

Métriques

Consultations de la notice

312

Téléchargements de fichiers

154