Skip to main content

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

  • Conference paper
Advances in Swarm Intelligence (ICSI 2010)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 6145))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Garey, D.: Computers and Intractability: A Guide to the Theory of NP Completeness. W. H. Freeman and Company, New York (1979)

    MATH  Google Scholar 

  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)

    Article  Google Scholar 

  3. XiaoShan, H., XiaoHe, S.: QoS Guided Min-Min Heuristic for Grid Task Scheduling. J. Comput. Sci. Technol. 18(4), 442–451 (2003)

    Article  MATH  Google Scholar 

  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. 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)

    Article  Google Scholar 

  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. Kim, J.-K.: Dynamically Mapping Tasks with Priorities and Multiple Deadlines in a Heterogeneous Environment. J. Parallel Distrib. Comput. 67, 154–169 (2007)

    Article  MATH  Google Scholar 

  8. Dorigo, M., Stützle, T.: Ant Colony Optimization. MIT Press, Cambridge (2004)

    MATH  Google Scholar 

  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. 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)

    Chapter  Google Scholar 

  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. 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. 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)

    Article  Google Scholar 

  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)

    Article  Google Scholar 

  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. 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)

    Article  Google Scholar 

  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 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, Y., Xing, L., Zhang, W., Xiao, W., Tang, D. (2010). A Knowledge-Based Ant Colony Optimization for a Grid Workflow Scheduling Problem. In: Tan, Y., Shi, Y., Tan, K.C. (eds) Advances in Swarm Intelligence. ICSI 2010. Lecture Notes in Computer Science, vol 6145. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13495-1_30

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-13495-1_30

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-13494-4

  • Online ISBN: 978-3-642-13495-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics