A Hierarchical Approach to Load Balancing in Distributed Systems
暂无分享,去创建一个
In this paper we present a hierarchical algo- rithm for performing dynamic load balancing in a distri- buted system The processors in the system are viewed as being in a lightly loaded, heavily loaded, or normally loaded state The goal of the algorithm is to keep all nodes normally loaded by migrating processes from heavily loaded nodes to lightly loaded nodes In addi- tion, the load balancing must involve low communica- tion overhead and respond quickly to load imbalance in the system The system is partitioned into disjoint groups of processors First intra-partition process migra- tion is performed to achieve an acceptable load distribu- tion If this is not sufficient, inter-partition load balanc- ing is carried out
[1] Andrew P. Black,et al. Fine-grained mobility in the Emerald system , 1987, TOCS.
[2] John A. Stankovic,et al. An Adaptive Bidding Algorithm For Processes, Clusters and Distributed Groups , 1984, ICDCS.
[3] Chong-Wei Xu,et al. A Distributed Drafting Algorithm for Load Balancing , 1985, IEEE Transactions on Software Engineering.
[4] Barton P. Miller,et al. Process migration in DEMOS/MP , 1983, SOSP '83.