PADS '99 Proceedings of the thirteenth workshop on Parallel and distributed simulation
An Efficient Adaptive Scheduling Scheme for Distributed Memory Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A hierarchical adaptive distributed algorithm for load balancing
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
In dynamic load sharing policies, system state information can be collected in a distributed manner or by a single coordinator node. Two principal policies that belong to the distributed scheme are the sender-initiated and receiver-initiated policies. In the centralized scheme, a central coordinator node is responsible for collecting system state information. Distributed policies do not perform as well as the centralized policy. Performance of distributed policies is sensitive to variance in job service times and inter-arrival times. Distributed policies, however, are scalable whereas the centralized policy can cause bottleneck and fault-tolerance problems for large systems. We propose a hierarchical load sharing policy that minimizes the drawbacks associated with the distributed and centralized policies while retaining their advantages. The results presented here show that the hierarchical policy inherits the merits of the centralized and distributed policies while minimizing the disadvantages associated with them.