Advertisement

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

  • Yanli Hu
  • Lining Xing
  • Weiming Zhang
  • Weidong Xiao
  • Daquan Tang
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6145)

Abstract

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.

Keywords

grid workflow scheduling quality of service ant colony optimization knowledge model 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Garey, D.: Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman and Company, New York (1979)zbMATHGoogle Scholar
  2. 2.
    Braun, T.D.: A Comparison Eleven Static Heuristics for Mapping a Class of Independent Tasks onto Heterogeneous Distributed Computing Systems. J. Parallel Distrib. Comput. 61, 810–837 (2001)CrossRefGoogle Scholar
  3. 3.
    XiaoShan, H., XiaoHe, S.: QoS Guided Min-Min Heuristic for Grid Task Scheduling. J. Comput. Sci. Technol. 18(4), 442–451 (2003)zbMATHCrossRefGoogle Scholar
  4. 4.
    Lopez, M.M., Heymann, E., Senar, M.A.: Analysis of Dynamic Heuristics for Workflow Scheduling on Grid Systems. In: 5th Int. Symp. Parallel Distrib. Comput. (ISPDC 2006), pp. 199–207 (2006)Google Scholar
  5. 5.
    Wang, L., Siegel, H.J., Roychowdhury, V.P., et al.: Task Matching and Scheduling in Heterogeneous Computing Environments Using a Genetic-Algorithm-based Approach. J. Parallel Distrib. Comput. 47, 8–22 (1997)CrossRefGoogle Scholar
  6. 6.
    Martino, V.D., Mililotti, M.: Scheduling in a Grid Computing Environment Using Genetic Algorithms. In: Int. Parallel Distrib. Process. Symp. (IPDPS 2002), pp. 235–239 (2002)Google Scholar
  7. 7.
    Kim, J.-K.: Dynamically Mapping Tasks with Priorities and Multiple Deadlines in a Heterogeneous Environment. J. Parallel Distrib. Comput. 67, 154–169 (2007)zbMATHCrossRefGoogle Scholar
  8. 8.
    Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)zbMATHGoogle Scholar
  9. 9.
    Xing, L.N., Chen, Y.W., Wang, P., et al.: A Knowledge-Based Ant Colony Optimization for Flexible Job Shop Scheduling Problems. Applied Soft Computing (2009) (to be published)Google Scholar
  10. 10.
    Stützle, T., Hoos, H.: MAX-MIN Ant System and Local Search for the Traveling Salesman Problem. In: IEEE Int. Conf. Evol. Comput. (ICEC 1997), pp. 309–314. IEEE Press, New York (1997)CrossRefGoogle Scholar
  11. 11.
    Zhao, Y.: Grid Middleware Services for Virtual Data Discovery Composition, and Integration. In: 2nd Workshop Middleware Grid Comput., Toronto, ON, Canada, pp. 57–62 (2004)Google Scholar
  12. 12.
    O’Brien, A., Newhouse, S., Darlington, J.: Mapping of Scientific Workflow within the E-Protein Project to Distributed Resources. In: UK e-Sci. All Hands Meet, Nottingham, UK, pp. 404–409 (2004)Google Scholar
  13. 13.
    Kolisch, R., Sprecher, A.: PSPLIB-A Project Scheduling Problem Library: OR Software-ORSEP Tasks Research Software Exchange Program. Eur. J. Oper. Res. 96(1), 205–216 (1997)CrossRefGoogle Scholar
  14. 14.
    Chen, W.N., Zhang, J.: An Ant Colony Optimization Approach to a Grid Workflow Scheduling Problem With Various QoS Requirements. IEEE Transactions on Systems and Cybernetics—PART C: Applications and Reviews 39(1), 29–44 (2009)CrossRefGoogle Scholar
  15. 15.
    Liu, J., Chen, L., Dun, Y., et al.: The Research of Ant Colony and Genetic Algorithm in Grid Task Scheduling. In: International Conference on Multi-Media and Information Technology, pp. 47–49 (2008)Google Scholar
  16. 16.
    Lo, S.T., Chen, R.M., Huang, Y.M., et al.: Multiprocessor System Scheduling with Precedence and Resource Constraints Using an Enhanced Ant Colony System. Expert Systems with Applications 34, 2071–2081 (2008)CrossRefGoogle Scholar
  17. 17.
    Merkle, D., Middendorf, M., Schmeck, H.: Ant Colony Optimization for Resource-Constrained Project Scheduling. IEEE Trans. Evol. Comput. 6(4), 53–66 (2002)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Yanli Hu
    • 1
  • Lining Xing
    • 1
  • Weiming Zhang
    • 1
  • Weidong Xiao
    • 1
  • Daquan Tang
    • 1
  1. 1.College of Information System and ManagementNational University of Defense TechnologyChangshaP.R. China

Personalised recommendations