| Abstract: | Computational grids allow the sharing of geographically distributed computational resources in an efficient, reliable, and secure manner. Grid is still in its infancy, and there are many problems associated with the computational grid, namely job scheduling, resource management, information service, information security, routing, fault tolerance, and many more. Scheduling of jobs on grid nodes is an NP‐class problem warranting for heuristic and meta‐heuristic solution approach. In the proposed work, a meta‐heuristic technique, auto controlled ant colony optimization, has been applied to solve this problem. The work observes the effect of interprocess communication in process to optimize turnaround time of the job. The proposed model has been simulated in Matlab. For the different scenarios in computational grid, results have been analyzed. Result of the proposed model is compared with another meta‐heuristic technique genetic algorithm that has been applied for the same purpose. It is found that auto controlled ant colony optimization not only gives better solution in comparison to genetic algorithm, but also converges faster because initial solution itself is good because of constructive and decision‐based policy adapted by the former. Concurrency and Computation: Practice and Experience, 2012.© 2012 Wiley Periodicals, Inc. |
