A MPU: ACS Algorithm for Grid Workflow Scheduling
Grid computing has emerged as an important field for sharing of large scale resources. One of the most challenging problems in grid computing is to schedule the workflow application to achieve high performance. The goal of scheduling is to achieve users QOS parameters and preferences. There are two QOS parameters have been considered, conservative time and cost. However there exist many algorithms deals with single QOS parameter, these algorithms do not offer efficient solution for the problem. Ant colony system with Modified Pheromone Update (MPU) rule to solve grid workflow scheduling problem.