DocumentCode
1721396
Title
Low cost load balancing algorithms
Author
Zhu, Weiping ; Goscinski, A.
Author_Institution
Sch. of Comput. & Inf. Sci., Univ. South Australia, Adelaide, SA, Australia
fYear
1994
Firstpage
226
Lastpage
235
Abstract
Two load-balancing algorithms that significantly reduce network traffic and the latency of the design-making process are presented in this paper. These algorithms take user behavior into account. Based on the intermittent behavior of a user using his/her computer, these algorithms adopt different measures to accelerate decision process and to reduce unnecessary communication. The measures used in these algorithms are beneficial to all type machines, especially to those machines that have bursty usage feature. The simulation shows that even without the intermittent feature on the job stream of each participant machine, these algorithms achieve better performance than other algorithms and have less overhead
Keywords
distributed processing; operating systems (computers); resource allocation; virtual machines; bursty usage feature; design-making process; distributed system; job stream; less overhead; low cost load balancing algorithms; network traffic; performance; simulation; user behavior; Australia Council; Costs; Decision making; Delay; Distributed algorithms; Load management; System performance; Workstations;
fLanguage
English
Publisher
ieee
Conference_Titel
Simulation Symposium, 1994., 27th Annual
Conference_Location
La Jolla, CA
Print_ISBN
0-8186-5620-4
Type
conf
DOI
10.1109/SIMSYM.1994.283093
Filename
283093
Link To Document