On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments
Issue No. 12 - December (2007 vol. 18)
In this paper, we address several issues that are imperative to Grid environments such as, handling resource heterogeneity and sharing, communication latency, job migration from one site to other, and load balancing.We address these issues by proposing two job migration algorithms, which are MELISA (Modified ELISA) and LBA (Load Balancing on Arrival). The algorithms differ in the way load balancing is carried out and is shown to be efficient in minimizing the response time on large and small scale heterogeneous Grid environments, respectively. MELISA, applicable to large scale systems (i.e., interGrid ), is a modified version of ELISA  in which we consider job migration cost, resource heterogeneity and network heterogeneity when load balancing is considered. LBA algorithm, applicable for small scale systems (i.e., intraGrid ), performs load balancing by estimating expected finish time of job on buddy processors on each job arrival. Both algorithms estimate system parameters such as job arrival rate, CPU processing rate, load at processor and balance the load by migrating jobs to buddy processors by taking into account job transfer cost, resource heterogeneity and network heterogeneity. We quantify the performance of our algorithms using several influencing parameters such as, job size, data transfer rate, status exchange period, migration limit, and we discuss the implications of the performance and choice of our approaches.
Grid systems, load balancing, average response time, communication delays, migration
M. Misra, B. Veeravalli and R. Shah, "On the Design of Adaptive and Decentralized Load Balancing Algorithms with Load Estimation for Computational Grid Environments," in IEEE Transactions on Parallel & Distributed Systems, vol. 18, no. , pp. 1675-1686, 2007.