Determining the Idle Time of a Tiling: New Results

Abstract : In the framework of fully permutable loops, tiling has been studied extensively as a source-to-source program transformation. We build upon recent results by Högsted, Carter, and Ferrante~\cite{HogstedtCF97}, who aim at determining the cumulated idle time spent by all processors while executing the partitioned (tiled) computation domain. We propose new, much shorter proofs of all their results and extend these in several important directions. More precisely, we provide an accurate solution for all values of the {\em rise} parameter that relates the shape of the iteration space to that of the tiles, and for all possible distributions of the tiles to processors. In contrast, the authors in~\cite{HogstedtCF97} deal only with a limited number of cases and provide upper bounds rather than exact formulas.
Type de document :
[Research Report] RR-3272, INRIA. 1997
Liste complète des métadonnées

Littérature citée [1 références]  Voir  Masquer  Télécharger
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 12:44:57
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:45:56



  • HAL Id : inria-00073417, version 1



Frédéric Desprez, Jack Dongarra, Fabrice Rastello, Yves Robert. Determining the Idle Time of a Tiling: New Results. [Research Report] RR-3272, INRIA. 1997. 〈inria-00073417〉



Consultations de la notice


Téléchargements de fichiers