A Solution to Grid Scheduling Problem Using an Improved ant Algorithm

In Grid computing, one of the major issues is grid scheduling. Grid scheduling provides nontrivial services to grid users. The complexity of the scheduler is fully depending on the grid size. The performance of the scheduler must be optimized in the dynamic grid flow environment. Grid scheduling is an NP-Complete problem. The NP-Complete problem can be easily solved by the heuristic optimization techniques. Ant Colony Optimization is one of the heuristic techniques to find out the optimal solution for this type of problems. This paper suggests a modified ant algorithm and also compares the performance of the proposed algorithm with the other existing algorithms. The performance is measured in terms of increasing the throughput and reducing the makespan. The experimental results show that the proposed algorithm can perform better than the exiting algorithms.