An improved diffusion algorithm for dynamic load balancing
Parallel Computing
Efficient schemes for nearest neighbor load balancing
Parallel Computing - Special issue on parallelization techniques for numerical modelling
Heterogeneous parallel and distributed computing
Parallel Computing - Special Anniversary issue
A Distributed Algorithm for Minimum-Weight Spanning Trees
ACM Transactions on Programming Languages and Systems (TOPLAS)
Server load balancing
Load Balancing in Parallel Computers: Theory and Practice
Load Balancing in Parallel Computers: Theory and Practice
Runtime Incremental Parallel Scheduling (RIPS) on Distributed Memory Computers
IEEE Transactions on Parallel and Distributed Systems
Optimal and Alternating-Direction Load Balancing Schemes
Euro-Par '99 Proceedings of the 5th International Euro-Par Conference on Parallel Processing
| Hi-index | 0.00 |
We study a dynamic load balancing problem for servers on the Internet as Grid, based on the differences of distributed computing to parallel computing. We propose an adaptive method according to initially assigned load; the optimal migration flow is directly obtained without any iterations, and the conditions of migration for the bottleneck edges are relaxed by the bypasses on a cactus adaptively extended from a spanning tree. Simulation results show that the number of rounds for the migration is decreased under 2/3 forthe conventional method, and that the cost with respect to the instability of migration is also decreased in about the half. Thus, the adaptively constructed cactus is considered as a practically efficient topology.