Dynamic Load Balancing in Grid Computing Using Ant Algorithm (ASRANK Approach)

Abstract

Grid Computing involves coordinated and coupled use of geographically distributed resources for purposes such as large-scale computation and distributed data analysis. Basically, grid computing is a collection of computer resources from multiple locations to reach a common goal. The grid computing is high-performance alternative to the traditional supercomputing environment, an appropriate and efficient load balancing algorithm is necessary to equally spread the load on each computing node in the grid. Load balancing for a huge number of systems is important problem which has to be solved in order to enable the efficient use of computer system, one way to solve this problem is to allocate the resources dynamically. In proposed algorithm, all solutions are ranked according to their length. The amount of pheromone deposited is then weighted for each solution, such that solutions with shorter paths deposit more pheromone than the solutions with longer paths.