Dynamic load balancing efficiently in a large-scale cluster

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.