A Knowledge-Based Ant Colony Optimization for a Grid Workflow Scheduling Problem

Service-oriented grid environment enables a new way of service provisioning based on utility computing models, where users consume services based on their QoS (Quality of Service) requirements In such “pay-per-use” Grids, workflow execution cost must be considered during scheduling based on users' QoS constraints In this paper, we propose a knowledge-based ant colony optimization algorithm (KBACO) for grid workflow scheduling with consideration of two QoS constraints, deadline and budget The objective of this algorithm is to find a solution that minimizes execution cost while meeting the deadline in terms of users' QoS requirements Based on the characteristics of workflow scheduling, we define pheromone in terms of cost and design a heuristic in terms of latest start time of tasks in workflow applications Moreover, a knowledge matrix is defined for the ACO approach to integrate the ACO model with knowledge model Experimental results show that our algorithm achieves solutions effectively and efficiently.

[1]  Ladislau Bölöni,et al.  A Comparison of Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems , 2001, J. Parallel Distributed Comput..

[2]  Rainer Kolisch,et al.  PSPLIB - a project scheduling problem library , 1996 .

[3]  Elisa Heymann,et al.  Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems , 2006, 2006 Fifth International Symposium on Parallel and Distributed Computing.

[4]  John Darlington,et al.  Mapping of Scientific Workflow within the e-Protein project to Distributed Resources , 2004 .

[5]  Marco Mililotti,et al.  Scheduling in a grid computing environment using genetic algorithms , 2002, Proceedings 16th International Parallel and Distributed Processing Symposium.

[6]  Li Chen,et al.  The Research of Ant Colony and Genetic Algorithm in Grid Task Scheduling , 2008, 2008 International Conference on MultiMedia and Information Technology.

[7]  Manuel López-Ibáñez,et al.  Ant colony optimization , 2010, GECCO '10.

[8]  Jun Zhang,et al.  An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements , 2009, IEEE Transactions on Systems, Man, and Cybernetics, Part C (Applications and Reviews).

[9]  Gregor von Laszewski,et al.  QoS guided Min-Min heuristic for grid task scheduling , 2003, Journal of Computer Science and Technology.

[10]  Hartmut Schmeck,et al.  Ant colony optimization for resource-constrained project scheduling , 2000, IEEE Trans. Evol. Comput..

[11]  SiegelHoward Jay,et al.  Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-Based Approach , 1997 .

[12]  T. Stützle,et al.  MAX-MIN Ant System and local search for the traveling salesman problem , 1997, Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC '97).

[13]  Peng Wang,et al.  A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems , 2010, Appl. Soft Comput..

[14]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[15]  Anthony A. Maciejewski,et al.  Dynamically mapping tasks with priorities and multiple deadlines in a heterogeneous environment , 2007, J. Parallel Distributed Comput..

[16]  Rainer Kolisch,et al.  PSPLIB - A project scheduling problem library: OR Software - ORSEP Operations Research Software Exchange Program , 1997 .

[17]  Yong Zhao,et al.  Grid middleware services for virtual data discovery, composition, and integration , 2004, MGC '04.

[18]  Yueh-Min Huang,et al.  Multiprocessor system scheduling with precedence and resource constraints using an enhanced ant colony system , 2008, Expert Syst. Appl..