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

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.
Document type :
Reports
Complete list of metadatas

Cited literature [32 references]  Display  Hide  Download

https://hal.inria.fr/inria-00071786
Contributor : Rapport de Recherche Inria <>
Submitted on : Tuesday, May 23, 2006 - 6:46:39 PM
Last modification on : Tuesday, November 19, 2019 - 2:45:39 AM

Identifiers

  • HAL Id : inria-00071786, version 1

Collections

Citation

Arnaud Legrand, Hélène Renard, Yves Robert, Frédéric Vivien. Load-balancing iterative computations in heterogeneous clusters with shared communication links. [Research Report] RR-4800, LIP RR-2003-23, INRIA, LIP. 2003. ⟨inria-00071786⟩

Share

Metrics

Record views

351

Files downloads

524