Mapping and Load-Balancing Iterative Computations on Heterogeneous Clusters

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.
Complete list of metadatas

https://hal.inria.fr/hal-00789450
Contributor : Arnaud Legrand <>
Submitted on : Monday, February 18, 2013 - 11:51:42 AM
Last modification on : Friday, April 20, 2018 - 3:44:24 PM

Links full text

Identifiers

Collections

Citation

Arnaud Legrand, Hélène Renard, Yves Robert, Frédéric Vivien. Mapping and Load-Balancing Iterative Computations on Heterogeneous Clusters. Euro-PVM-MPI-2003: Recent Advances in Parallel Virtual Machine and Message Passing Interface, 2003, Unknown, pp.586―594, ⟨10.1007/978-3-540-39924-7_79⟩. ⟨hal-00789450⟩

Share

Metrics

Record views

231