Efficient Multiple Ant Colony Algorithm for Job Scheduling in Grid Environment

Grid computing is now being used in many applications that are beyond distribution and sharing of resources. One primary issue associated with the efficient utilization of heterogeneous resources in a grid environment is task scheduling. Task Scheduling is an important issue of current implementation of grid computing. The demand for scheduling is to achieve high performance computing. If large numbers of tasks are computed on the geographically distributed resources, a reasonable scheduling algorithm must be adopted in order to get the minimum completion time.