By Topic

Adaptive bidding load balancing algorithms in heterogeneous distributed systems

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

3 Author(s)
Y. Zhang ; Dept. of Comput. Sci., Univ. of Electro-Commun., Tokyo, Japan ; H. Kameda ; K. Shimizu

Describes three adaptive bidding load balancing algorithms, each of which balances the workload on hosts (nodes) using different amounts of system state information in a heterogeneous distributed system model. A key feature of these algorithms is that they attempt to balance the virtual delay (unfinished work) of each node. Using simulation, the algorithms are examined and compared with Eager's (1986) `shortest algorithm', an efficient algorithm in homogeneous systems. Results show that the simple algorithms we consider in this paper, which use very little system state information, yield dramatic performance improvements over the case of no load balancing and perform much better than Eager's algorithm

Published in:

Modeling, Analysis, and Simulation of Computer and Telecommunication Systems, 1994., MASCOTS '94., Proceedings of the Second International Workshop on

Date of Conference:

31 Jan-2 Feb 1994