Tiling with Limited Resources

Pierre-Yves Calland 1 Jack Dongarra 2 Yves Robert 1
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : In the framework of perfect loop nests with uniform dependences, tiling has been extensively studied as a source-to-source program transformati- on. Little work has been devoted to the mapping and scheduling of the tiles on to physical processors. We present several new results in the context of limited computational resources, and assuming communication-computation overlap. In particular, under some reasonable assumptions, we derive the optimal mapping and scheduling of tiles to physical processors.
Type de document :
Rapport
[Research Report] RR-3183, INRIA. 1997
Liste complète des métadonnées

https://hal.inria.fr/inria-00073506
Contributeur : Rapport de Recherche Inria <>
Soumis le : mercredi 24 mai 2006 - 13:05:14
Dernière modification le : vendredi 20 avril 2018 - 15:44:24
Document(s) archivé(s) le : dimanche 4 avril 2010 - 23:48:28

Fichiers

Identifiants

  • HAL Id : inria-00073506, version 1

Collections

Citation

Pierre-Yves Calland, Jack Dongarra, Yves Robert. Tiling with Limited Resources. [Research Report] RR-3183, INRIA. 1997. 〈inria-00073506〉

Partager

Métriques

Consultations de la notice

241

Téléchargements de fichiers

187