A Distributed Drafting Algorithm for Load Balancing
IEEE Transactions on Software Engineering
Adaptive load sharing in homogeneous distributed systems
IEEE Transactions on Software Engineering
Distributed control of computer systems
IEEE Transactions on Computers - The MIT Press scientific computation series
A comparison of receiver-initiated and sender-initiated adaptive load sharing
Performance Evaluation
Dynamic load balancing for distributed memory multiprocessors
Journal of Parallel and Distributed Computing
A simulated annealing method for mapping production systems onto multicomputers
Proceedings of the sixth conference on Artificial intelligence applications
A load index for dynamic load balancing
ACM '86 Proceedings of 1986 ACM Fall joint computer conference
Load balancing in homogeneous broadcast distributed systems
Proceedings of the Computer Network Performance Symposium
Performance prediction of distributed load balancing on multicomputer systems
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
Semi-Distributed Load Balancing for Massively Parallel Multicomputer Systems
IEEE Transactions on Software Engineering
ACM Computing Surveys (CSUR)
Topology preserving dynamic load balancing for parallel molecular simulations
SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
| Hi-index | 0.00 |
In this paper, a new adaptive scheme is presented for dynamic load balancing on a message-passing multicomputer. The scheme is based on using easy-to-implement heuristics and variable threshold in migrating processes among the multicomputer nodes. It uses a distributed control over all processor nodes as coordinated by a host processor. Four heuristic methods for process migration are presented, which are distinguished by choosing different policies for process migration and threshold update. A parallel simulator with distributed load balancers is developed on an iPSC/2 hypercube system. The load balancing scheme is evaluated on the effects of system utilization, load imbalance, communication and migration overhead, and multicomputer size. Relative merits of the four methods are revealed under various multicomputer conditions.