ABSTRACT

The grid computing system is a new, powerful and innovative system for a group of heterogeneous distributed computing systems. It requires grid scheduling to achieve high performance. The efficient scheduling of independent jobs in a heterogeneous computing environment is an important problem in domains such as grid computing. In general, finding optimal schedule for such an environment using the traditional sequential method is an NP-hard problem whereas heuristic approaches will provide near optimal solutions for complex problems. The Ant colony algorithm, which is one of the heuristic algorithms, suits well for the grid scheduling environment using stigmeric communication. The proposed Ant colony algorithm in this paper has a modified pheromone updating rule which solves the grid scheduling problem effectively than that of the existing Ant colony algorithm.