Dual and multiple token based approaches for load balancing
Journal of Systems Architecture: the EUROMICRO Journal
IEEE Transactions on Parallel and Distributed Systems
Fast load balancing with the most to least loaded policy in dynamic networks
The Journal of Supercomputing
Distributed load balancing over directed network topologies
ACC'09 Proceedings of the 2009 conference on American Control Conference
SALSA: QoS-aware load balancing for autonomous service brokering
Journal of Systems and Software
Design and analysis of the M2LL policy distributed algorithm for load balancing in dynamic networks
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
| Hi-index | 0.00 |
The DASUD (Diffusion Algorithm Searching Unbalanced Domains) algorithm belongs to the nearest-neighbours class and operates in a diffusion scheme where a processor balances its load with all its neighbours. DASUD detects unbalanced domains and performs local exchange of load between processors to achieve global balancing. The DASUD algorithm has been evaluated by comparison with another well-known strategy, namely, the SID (Sender Initiated Diffusion) algorithm across a range of networks topologies including ring, torus and hypercube where the number of processors varies from 8 to 128. From the experiments we have observed that DASUD outperforms the other strategy as it provides the best trade-off between the balance degree obtained at the final state and the number of iterations required to reach such state. DASUD is able to coerce any initial load distribution into a highly balanced global state and also exhibits good scalability properties.