Scheduling efficiently for irregular load distributions 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, P.R. China;Institute of Applied Physics and Computational Mathematics, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China;Department of Computer Science and Technology, Tsinghua University, Beijing, P.R. China
Venue:
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Year:
2005

Citing 8
Cited 0

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
Load Distributing for Locally Distributed Systems

Computer
Satin: Efficient Parallel Divide-and-Conquer in Java

Euro-Par '00 Proceedings from the 6th International Euro-Par Conference on Parallel Processing
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

Quantified Score

Hi-index	0.01

Visualization

Abstract

Random stealing is a well-known dynamic scheduling algorithm. However, in a large-scale cluster, an idle node must randomly steal many times to obtain a task from another node, especially, this problem severely affects performance in systems where only a few nodes generate most of the system workload. In this paper, we present an efficient dynamic scheduling algorithm, Transitive Random Stealing (TRS) based on random stealing, which makes any idle node rapidly obtain a task from another node for irregular load distributions in a large-scale cluster. Then by the random baseline technique, we experimentally compare TRS with Shis, one of load balance policies in the EARTH system, and random stealing for different load distributions in the Tsinghua EastSun cluster and show that TRS is a highly efficient scheduling algorithm for irregular load distributions in a large-scale cluster. Finally, TRS is implemented in the Jcluster environment, a high performance Java parallel environment, and an experiment result is given in the HKU Gideon 300 cluster.