By Topic

How network topology affects dynamic loading balancing

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
$31 $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)
Loh, P.K.K. ; Sch. of Appl. Sci., Nanyang Technol. Inst., Singapore ; Wen Jing Hsu ; Cai Wentong ; Sriskanthan, N.

Previous research has proposed several different load-balancing strategies and measured their performances on either a distributed system or a multiprocessor network of specific topology. The authors broadly classify all load-balancing strategies as being either static or dynamic. For certain applications, dynamic load balancing is preferable, because then the problem's variable behavior more closely matches available computational resources. The authors address the performance of five dynamic load-balancing strategies: the Gradient Model strategy, the Sender-Initiated and Receiver-Initiated strategies, the Central Job Dispatcher strategy, and the Prediction-based strategy. The authors use a trace-driven simulation approach, collecting job traces from a production-distributed computer system and using them to simulate a loosely coupled multiprocessor network. This simulator enables performance comparisons across a range of network topologies, including a 2D-mesh, a 4D-hypercube, a linear array, and a composite Fibonacci cube

Published in:

Parallel & Distributed Technology: Systems & Applications, IEEE  (Volume:4 ,  Issue: 3 )