Resolving Load Balancing Issue of Grid Computing through Dynamic Approach

-Load balancing has been a key concern for traditional multiprocessor systems. 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. Due to the dynamic property of grid environment, fixed-parameter prediction model cannot exert its forecast capability completely. To improve the global throughput of computational grid, effective and efficient load balancing algorithms are fundamentally important. A computational grid differs from traditional high-performance computing system in the heterogeneity of computing nodes, as well as the communication links that connect the different nodes together. A dynamic and decentralized load balancing algorithm for computationally intensive jobs on a heterogeneous distributed computing platform is required. The time spent by a job in the system is considered as the main issue that needs to be minimized. A resource queue length based solution to the grid load balancing problem has been proposed in this dissertation. An algorithm that is dynamic, decentralized and distributed for load balancing among the aggregated processing elements in the grid has proposed .The proposed algorithm balances the load in the grid based on the queue length of each processing element and transfer the task to the processing element having minimum queue length. The proposed Algorithm is implemented with the help of GridSim toolkit. The Simulations are performed for number of users and processing elements. __________________________________________________*****_________________________________________________