Dynamic load balancing efficiently in a large-scale cluster

Authors:
Bao-Yin Zhang;Ze-Yao Mo;Guang-Wen Yang;Wei-Min Zheng
Affiliations:
Institute of Applied Physics and Computational Mathematics, Beijing, 100088, PR China.;Institute of Applied Physics and Computational Mathematics, Beijing, 100088, PR China.;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, PR China.;Department of Computer Science and Technology, Tsinghua University, Beijing, 100084, PR China
Venue:
International Journal of High Performance Computing and Networking
Year:
2009

Citing 8
Cited 2

A comparison of receiver-initiated and sender-initiated adaptive load sharing

Performance Evaluation
Communication complexity for parallel divide-and-conquer

SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science
Cilk: an efficient multithreaded runtime system

PPOPP '95 Proceedings of the fifth ACM SIGPLAN symposium on Principles and practice of parallel programming
A design study of the EARTH multiprocessor

PACT '95 Proceedings of the IFIP WG10.3 working conference on Parallel architectures and compilation techniques
Efficient load balancing for wide-area divide-and-conquer applications

PPoPP '01 Proceedings of the eighth ACM SIGPLAN symposium on Principles and practices of parallel programming
MANNA: Prototype of a Distributed Memory Architecture with Maximized Sustained Performance

PDP '96 Proceedings of the 4th Euromicro Workshop on Parallel and Distributed Processing (PDP '96)
The Natural Work-Stealing Algorithm is Stable

SIAM Journal on Computing
Scheduling multithreaded computations by work stealing

SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science

On the scalability and dynamic load-balancing of optimistic gate level simulation

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
A Multi-State Q-Learning Approach for the Dynamic Load Balancing of Time Warp

PADS '10 Proceedings of the 2010 IEEE Workshop on Principles of Advanced and Distributed Simulation

Quantified Score

Hi-index	0.00

Visualization

Abstract

Random Stealing (RS) is a well-known dynamic load-balancing algorithm, used both in shared-memory and distributed-memory systems. However, for a large-scale cluster, the simple RS policy is no longer efficient because an idle node must randomly steal many times to obtain a task from another node. In this paper, we propose a novel dynamic load-balancing algorithm, Transitive Random Stealing (TRS), which can make any idle node obtain a task from another node with much fewer stealing times in a large-scale cluster. Analysing and testing show that TRS is a highly efficient dynamic load-balancing algorithm in a large-scale cluster.