This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
How Network Topology Affects Dynamic Load Balancing
Fall 1996 (vol. 4 no. 3)
pp. 25-35
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. This paper addresses the performances of five dynamic load balancing strategies. A simulator has been developed to allow performance comparisons to be made across a range of network topologies: a 2D-mesh, a 4D-hypercube, a linear array, and a composite Fibonacci cube. The Fibonacci cube is one of the more recently proposed novel interconnection topologies. Results show that the performance of a dynamic load balancing strategy is affected by both the average processor distance and average node degree of the network.
Index Terms:
parallel processing, multiprocessors, load balancing, topology, Fibonacci cube, dynamic load balancing strategies
Citation:
Peter Kok Keong Loh, Wen Jing Hsu, Cai Wentong, Nadarajah Sriskanthan, "How Network Topology Affects Dynamic Load Balancing," IEEE Concurrency, vol. 4, no. 3, pp. 25-35, Fall 1996, doi:10.1109/88.532137
Usage of this product signifies your acceptance of the Terms of Use.