The Community for Technology Leaders
Performance, Computing, and Communications Conference, 2002. 21st IEEE International (2006)
Phoenix, AZ, USA
Apr. 10, 2006 to Apr. 12, 2006
ISBN: 1-4244-0198-4
pp: 44
A.Y. Zomaya , Sch. of Inf. Technol., Sydney Univ., NSW, Australia
K. Lu , Sch. of Inf. Technol., Sydney Univ., NSW, Australia
R. Subrata , Sch. of Inf. Technol., Sydney Univ., NSW, Australia
ABSTRACT
Many scheduling and load balancing solutions have been proposed for traditional distributed computing systems. However, they all suffer from significant deficiencies when extended to a Grid environment: some use a centralized approach that makes the algorithms not scalable, while others either ignore the difference in processing power among grid sites, or assign loads among grid sites without considering communication overhead in collecting load information. In this paper, we present an efficient desirability-aware load balancing algorithm to tackle the above new challenges in heterogeneous grid systems. The simulation results show that our proposed algorithm yields better performance when compared with the so-called "Nearest Neighbor" load balancing (LB) algorithm. Our algorithm is dynamic, sender-initiated and decentralized.
INDEX TERMS
scheduling, load balancing algorithm, grid sites desirability, heterogeneous grid system
CITATION
A.Y. Zomaya, K. Lu, R. Subrata, "An efficient load balancing algorithm for heterogeneous grid systems considering desirability of grid sites", Performance, Computing, and Communications Conference, 2002. 21st IEEE International, vol. 00, no. , pp. 44, 2006, doi:10.1109/.2006.1629422
90 ms
(Ver 3.3 (11022016))