DocumentCode
1989938
Title
Designing Load Balancing Algorithms Capable of Dealing with Workload Variability
Author
Beltran, M. ; Guzman, Armando
Author_Institution
DATCCCIA, ETSII, Rey Juan Carlos Univ., Mostoles
fYear
2008
fDate
1-5 July 2008
Firstpage
107
Lastpage
114
Abstract
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.
Keywords
resource allocation; cluster system; load balancing algorithm; robustness metrics; workload variability; Algorithm design and analysis; Availability; Clustering algorithms; Control systems; Costs; Degradation; Distributed computing; Load management; Performance analysis; Robustness; Cluster computing; load balancing; workload variability;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Computing, 2008. ISPDC '08. International Symposium on
Conference_Location
Krakow
Print_ISBN
978-0-7695-3472-5
Type
conf
DOI
10.1109/ISPDC.2008.13
Filename
4724236
Link To Document