Data redistribution algorithms for heterogeneous processor rings

Hélène Renard 1 Yves Robert 1 Frédéric Vivien 1
1 GRAAL - Algorithms and Scheduling for Distributed Heterogeneous Platforms
Inria Grenoble - Rhône-Alpes, LIP - Laboratoire de l'Informatique du Parallélisme
Abstract : We consider the problem of redistributing data on homogeneous and heterogeneous ring of processors. The problem arises in several applications, each time after that a load-balancing mechanism is invoked (but we do not discuss the load-balancing mechanism itself). We provide algorithms that aim at optimizing the data redistribution, both for uni-directional and bi-directional rings, and we give complete proofs of correctness. One major contribution of the paper is that we are able to prove the optimality of the proposed algorithms in all cases except that of a bi-directional heterogeneous ring, for which the problem remains open.
Document type :
Reports
Complete list of metadatas

Cited literature [24 references]  Display  Hide  Download

https://hal.inria.fr/inria-00070785
Contributor : Rapport de Recherche Inria <>
Submitted on : Friday, May 19, 2006 - 9:37:31 PM
Last modification on : Thursday, May 2, 2019 - 2:31:09 PM

Identifiers

  • HAL Id : inria-00070785, version 1

Collections

Citation

Hélène Renard, Yves Robert, Frédéric Vivien. Data redistribution algorithms for heterogeneous processor rings. [Research Report] RR-5207, LIP RR-2004-28, INRIA, LIP. 2004, pp.37. ⟨inria-00070785⟩

Share

Metrics

Record views

218

Files downloads

348