A dynamic distributed load balancing algorithm with provable good performance
SPAA '93 Proceedings of the fifth annual ACM symposium on Parallel algorithms and architectures
Developing SPMD applications with load balancing
Parallel Computing
Dual and multiple token based approaches for load balancing
Journal of Systems Architecture: the EUROMICRO Journal
Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing)
Parallel Combinatorial Optimization (Wiley Series on Parallel and Distributed Computing)
| Hi-index | 0.00 |
The paper suggests an algorithm for token-based adaptive load balancing for dynamically parallel computations on multicomputer platforms. The proposed algorithm for load balance is initiated and performed by the idle or under-loaded processes and requires token message circulating among the parallel processes and bearing information about the load distribution throughout the system. The efficiency of the algorithm is estimated for the case study of Sam Loyd's puzzle utilizing parallel version of branch-and-bound search algorithm with depth-first search strategy. The experimental study is based on flat parallel program implementations. Speedup and efficiency of the parallel system are estimated as well as scalability of the application workload and the multicomputer size.