Load-balancing iterative computations in heterogeneous clusters with shared communication links

Arnaud Legrand 1 Hélène Renard Yves Robert Frédéric Vivien
1 REMAP - Regularity and massive parallel computing
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : This paper is devoted to 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 to assign these chunks to the processors, so that the total execution time is minimized. One 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 that assesses the difficulty of this problem, and we design a practical heuristic that provides efficient mapping, routing, and data distribution schemes.
Type de document :
RR-4800, INRIA. 2003
Liste complète des métadonnées

Contributeur : Rapport de Recherche Inria <>
Soumis le : mardi 23 mai 2006 - 18:46:39
Dernière modification le : samedi 17 septembre 2016 - 01:30:16
Document(s) archivé(s) le : dimanche 4 avril 2010 - 22:38:04



  • HAL Id : inria-00071786, version 1



Arnaud Legrand, Hélène Renard, Yves Robert, Frédéric Vivien. Load-balancing iterative computations in heterogeneous clusters with shared communication links. RR-4800, INRIA. 2003. <inria-00071786>



Consultations de
la notice


Téléchargements du document