By Topic

Dynamic task assignment in server farms: better performance by task grouping

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

2 Author(s)
Ling Tan ; Sch. of Comput. Sci. & Inf. Technol., RMIT Univ., Melbourne, Vic., Australia ; Tari, Z.

This paper describes a dynamic load balancing approach to distributed server farm systems. This approach overcomes the interference caused by non-negligible very large tasks in the heavy-tailed distribution. First, a subset of tasks is allocated proportionally to the processing capability of participating servers by taking into account their remaining processing time. Later, tasks in the servers are processed in order of priority to optimise the system response time. The proposed load balancing algorithm also takes into account the information on server loads to avoid load imbalance caused by very large tasks. The experiments show that the mean waiting time and the mean slowdown time are reduced at the server farm system.

Published in:

Computers and Communications, 2002. Proceedings. ISCC 2002. Seventh International Symposium on

Date of Conference:

2002