Abstract—Grid computing is the next generation of distributed heterogeneous systems. It provides the highest productivity, utilizing the existing infrastructure. One of the most challenging issues in Grid computing is the efficiency of job scheduling in the distributed environment. Job scheduling in the grid environment is an NP complete problem. Heuristic approach is one of the best ways to solve the NP complete problem. The Scheduler considers the characteristics of resources such as geographic distribution, heterogeneity, different usage policies, non-uniform performance, varying loads and availability. The scheduler finds the suitable resource for each job. It leads to the effective utilization of grid resources. This paper proposes an adaptive scheduling algorithm, called Online Ant (OANT). The OANT uses the dynamic information of resources and jobs. The OANT algorithm uses the ant colony optimization heuristic technique. In this paper, performance of OANT is compared with other existing methods. It is found that the OANT algorithm can effectively and efficiently allocate jobs to proper resources.
Index Terms—Grid Computing, Scheduling, Ant Colony Optimization, Job Scheduling. Computational grid, Scheduling Algorithm
K. Kousalya is with the Kongu Engineering College, Perundurai, India Phone 04294 226560 firstname.lastname@example.org.
Dr P. Balasubramanie is with the Kongu Engineering College, Perundurai, India, email- email@example.com
Cite: Kousalya K and Balasubramanie P, "Online Grid Scheduling Using Ant Algorithm," International Journal of Engineering and Technology vol. 1, no. 1, pp. 21-26, 2009.