Skip to Main Content
Decrease in hardware costs and advances in computer networking technologies have led to increased interest in the use of grid computing systems. One of the biggest issues in such systems is the development of effective techniques/algorithms for the distribution of the jobs/load of a grid application on multiple resources to achieve goals such as minimizing execution time, minimizing communication delays, maximizing resource utilization and maximizing throughput. The Grid computing infrastructure load balancing issues are concerned with the traditional distribution of workload among the resources in a Grid environment. To improve the global throughput of these environments, effective and efficient Load Balancing algorithms are fundamentally important. The emergence of computational grids extends this challenge to deal with more serious problems such as scalability, heterogeneity of computing resources and considerable transfer delay. By considering all these issues we proposed a Hierarchical Based Load Balancing algorithm. The main benefit of this algorithm was to reduce the Average Response Time (ART) for the grid application. The algorithm was evaluated on a Java based discrete event grid simulation toolkit called GridSim. The proposed load-balancing algorithm has been compared with other load balancing schemes such as Perfect Information on Arrival (PIA) and Minimum Completion Time (MCT). The results of simulative experiments show that our proposed algorithm is effective. We have realized a significant improvement in average response time. It means that the proposed model can lead to the better load balancing between resources without high overhead.
Date of Conference: 13-15 Dec. 2009