The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (2007 vol.18)
pp: 485-497
ABSTRACT
<p><b>Abstract</b>—A regeneration-theory approach is undertaken to analytically characterize the average overall completion time in a distributed system. The approach considers the heterogeneity in the processing rates of the nodes as well as the randomness in the delays imposed by the communication medium. The optimal one-shot load balancing policy is developed and subsequently extended to develop an autonomous and distributed load-balancing policy that can dynamically reallocate incoming external loads at each node. This adaptive and dynamic load balancing policy is implemented and evaluated in a two-node distributed system. The performance of the proposed dynamic load-balancing policy is compared to that of static policies as well as existing dynamic load-balancing policies by considering the average completion time per task and the system processing rate in the presence of random arrivals of the external loads.</p>
INDEX TERMS
Renewal theory, queuing theory, distributed computing, dynamic load balancing.
CITATION
Sagar Dhakal, Majeed M. Hayat, Jorge E. Pezoa, Cundong Yang, David A. Bader, "Dynamic Load Balancing in Distributed Systems in the Presence of Delays: A Regeneration-Theory Approach", IEEE Transactions on Parallel & Distributed Systems, vol.18, no. 4, pp. 485-497, April 2007, doi:10.1109/TPDS.2007.1009
5 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool