Dynamic load balancing for parallel program execution on a message-passing multicomputer

Dynamic load balancing solves the remapping problem in a multicomputer system at run time, where many processes need to be allocated evenly to multiple processor nodes. The mean is to migrate processes from busy to idle nodes in order to achieve higher resource utilization. The authors have implemented a distributed load balancer at an iPSC/2 hypercube computer system, which uses heuristic methods to balance the system load adaptively. These heuristic methods cooperate with a central supervisor at the host machine, and invoke the load balancing activities under decentralized control. Benchmark experiments have shown that the proposed dynamic load balancing methods can speed up the parallel execution of benchmark programs significantly.<<ETX>>

[1]  Chong-Wei Xu,et al.  A Distributed Drafting Algorithm for Load Balancing , 1985, IEEE Transactions on Software Engineering.

[2]  Jian Xu,et al.  Heuristic methods for dynamic load balancing in a message-passing supercomputer , 1990, Proceedings SUPERCOMPUTING '90.

[3]  Robert M. Keller,et al.  Gradient Model: A Demand-Driven Load Balancing Scheme , 1986, ICDCS.

[4]  Kai Hwang,et al.  A simulated annealing method for mapping production systems onto multicomputers , 1990, Sixth Conference on Artificial Intelligence for Applications.

[5]  Donald F. Towsley,et al.  Imbedding gradient estimators in load balancing algorithms , 1988, [1988] Proceedings. The 8th International Conference on Distributed.

[6]  Kai Hwang,et al.  Load balancing methods for message-passing multicomputers , 1990 .

[7]  Edward D. Lazowska,et al.  Adaptive load sharing in homogeneous distributed systems , 1986, IEEE Transactions on Software Engineering.

[8]  Kemal Efe,et al.  Minimizing control overheads in adaptive load sharing , 1989, [1989] Proceedings. The 9th International Conference on Distributed Computing Systems.