Skip to Main content Skip to Navigation
New interface
Journal articles

Data redistribution algorithms for heterogeneous processor rings

Hélène Renard 1, 2 Yves Robert 1, 2 Frédéric Vivien 1, 2 
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 rings of processors. The problem arises in several applications, after each invoca-tion of a load-balancing mechanism (but we do not discuss the load-balancing mechanism itself). We provide algorithms that aim at optimizing the data redistribution, both for unidirectional and bidirectional rings. One major contribution of the paper is that we are able to prove the opti-mality of the proposed algorithms in all cases except that of a bidirectional heterogeneous ring, for which the problem remains open.
Complete list of metadata

Cited literature [39 references]  Display  Hide  Download

https://hal.inria.fr/hal-00804395
Contributor : Equipe Roma Connect in order to contact the contributor
Submitted on : Tuesday, November 13, 2018 - 2:28:00 PM
Last modification on : Tuesday, October 25, 2022 - 4:20:43 PM
Long-term archiving on: : Thursday, February 14, 2019 - 12:19:20 PM

File

IJHPCA-definitive.pdf
Files produced by the author(s)

Identifiers

Citation

Hélène Renard, Yves Robert, Frédéric Vivien. Data redistribution algorithms for heterogeneous processor rings. International Journal of High Performance Computing Applications, 2006, 20 (1), pp.31-43. ⟨10.1177/1094342006061887⟩. ⟨hal-00804395⟩

Share

Metrics

Record views

77

Files downloads

85