By Topic

Performance comparison of dynamic load-balancing strategies for distributed computing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
A. Cortes ; Comput. Archit. & Oper. Syst. Group, Univ. Autonoma de Barcelona, Spain ; A. Ripoll ; M. A. Senar ; E. Luque

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 network 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-of-between the balance degree obtained at the final state and the number of iterations required to reach such a state. DASUD is able to coerce any initial load distribution into a highly balanced global state and also exhibits good scalability properties.

Published in:

Systems Sciences, 1999. HICSS-32. Proceedings of the 32nd Annual Hawaii International Conference on  (Volume:Track8 )

Date of Conference:

5-8 Jan. 1999