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 Hogsted, Carter, and Ferrante (1997), 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 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 Hogsted, Carter, and Ferrante (1997) deal only with a limited number of cases and provide upper bounds rather than exact formulas
Type de document :
Communication dans un congrès
Parallel Architectures and Compilation Techniques PACT'97, Nov 1997, San Francisco, United States. IEEE Computer Society Press, pp.307-317, 1997, 〈10.1109/PACT.1997.644026〉
Liste complète des métadonnées

https://hal.inria.fr/hal-00856894
Contributeur : Equipe Roma <>
Soumis le : lundi 2 septembre 2013 - 16:19:13
Dernière modification le : mercredi 14 décembre 2016 - 01:06:16

Identifiants

Collections

Citation

Frédéric Desprez, Jack Dongarra, Fabrice Rastello, Yves Robert. Determining the idle time of a tiling: new results. Parallel Architectures and Compilation Techniques PACT'97, Nov 1997, San Francisco, United States. IEEE Computer Society Press, pp.307-317, 1997, 〈10.1109/PACT.1997.644026〉. 〈hal-00856894〉

Partager

Métriques

Consultations de la notice

218