By Topic

Designing Load Balancing Algorithms Capable of Dealing with Workload Variability

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)
Beltran, M. ; DATCCCIA, ETSII, Rey Juan Carlos Univ., Mostoles ; Guzman, A.

The workload on a cluster system can be highly variable, increasing the difficulty of balancing the load across its nodes. And the general rule is that high variability leads to wrong load balancing decisions taken with out-of-date information and difficult to correct in real-time during applications execution.In this work the workload variability is studied from the perspective of the load balancing performance, focusing on the design of algorithms capable of dealing with this variability. Two different robustness metrics are proposed to select the best distribution rule for the algorithm, remote execution or process migration. With the proposed solution only when a high variability causes an intolerable performance degradation the process migration is used to balance the load in the system.

Published in:

Parallel and Distributed Computing, 2008. ISPDC '08. International Symposium on

Date of Conference:

1-5 July 2008