Load-Balancing Iterative Computations on Heterogeneous Clusters with Shared Communication Links

Abstract : We focus on mapping iterative algorithms onto heterogeneous clusters. The application data is partitioned over the processors, which are arranged along a virtual ring. At each iteration, independent calculations are carried out in parallel, and some communications take place between consecutive processors in the ring. The question is to determine how to slice the application data into chunks, and assign these chunks to the processors, so that the total execution time is minimized. A major difficulty is to embed a processor ring into a network that typically is not fully connected, so that some communication links have to be shared by several processor pairs. We establish a complexity result assessing the difficulty of this problem, and we design a practical heuristic that provides efficient mapping, routing, and data distribution schemes.
Type de document :
Communication dans un congrès
PPAM-2003: Fifth International Conference on Parallel Processing and Applied Mathematics, 2003, Unknown, Springer Verlag, pp.930―937, 2003, LNCS 3019. <10.1007/978-3-540-24669-5_120>
Liste complète des métadonnées

https://hal.inria.fr/hal-00789452
Contributeur : Arnaud Legrand <>
Soumis le : lundi 18 février 2013 - 11:51:44
Dernière modification le : mercredi 14 décembre 2016 - 01:06:51

Identifiants

Collections

Citation

Arnaud Legrand, Hélène Renard, Yves Robert, Frédéric Vivien. Load-Balancing Iterative Computations on Heterogeneous Clusters with Shared Communication Links. PPAM-2003: Fifth International Conference on Parallel Processing and Applied Mathematics, 2003, Unknown, Springer Verlag, pp.930―937, 2003, LNCS 3019. <10.1007/978-3-540-24669-5_120>. <hal-00789452>

Partager

Métriques

Consultations de la notice

92