Data redistribution algorithms for homogeneous and heterogeneous processor rings

Authors:
Hélène Renard;Yves Robert;Frédéric Vivien
Affiliations:
LIP, UMR CNRS-INRIA-UCBL, ENS Lyon, France;LIP, UMR CNRS-INRIA-UCBL, ENS Lyon, France;LIP, UMR CNRS-INRIA-UCBL, ENS Lyon, France
Venue:
HiPC'04 Proceedings of the 11th international conference on High Performance Computing
Year:
2004

Citing 3
Cited 0

Using pathchar to estimate Internet link characteristics

SIGMETRICS '99 Proceedings of the 1999 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Scheduling Distributed Applications: the SimGrid Simulation Framework

CCGRID '03 Proceedings of the 3st International Symposium on Cluster Computing and the Grid
Modeling Internet topology

IEEE Communications Magazine

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of redistributing data on homogeneous and heterogeneous processor rings The problem arises in several applications, each time after 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 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.