By Topic

An improved algorithm of two choices in randomized dynamic load-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
$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

2 Author(s)
Yibing Wang ; Dept. of Comput. & Inf. Sci., Alabama Univ., Birmingham, AL, USA ; Hyatt, R.

We study a kind of randomized dynamic load-balancing scheme, which, upon new task arrival, selects some constant d (d /spl ges/ 2) servers out of n servers in an independently and uniformly randomized fashion and places the newly arrived task to the least-loaded one among the d choices. To overcome the weakness of previous results when they are used in real settings, we propose an improved algorithm. We add a sliding-window technique to the original concept of Mitzenmacher's (1996) two choices (d = 2) in randomized load-balancing. We prove that our algorithm converges to an equilibrium state in a much moderate condition than what was required in previous studies.

Published in:

Algorithms and Architectures for Parallel Processing, 2002. Proceedings. Fifth International Conference on

Date of Conference:

23-25 Oct. 2002