Skip to main content

A Concurrent Level Based Scheduling for Workflow Applications within Cloud Computing Environment

  • Conference paper
Pervasive Computing and the Networked World (ICPCA/SWS 2013)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 8351))

Abstract

Cost minimization under deadline-constraint-based workflow scheduling described by Directed Acyclic Graph (DAG) is a NP-hard problem in Cloud Environment. In order to address such problem, this paper proposes a novel heuristics approach of Concurrent-Level-based Workflow Scheduling (CLWS). It stratifies all the tasks according to the concurrence among tasks during the actual workflow execution. CLWS distributes the total redundancy time into every level according to their concurrent degree. As well as it adopts the algorithm of Markov Decision Process (MDP) to optimize tasks, which have time dependence with each other in the same level. The Simulation results show that CLWS can give a better optimized result.

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 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Bhardwaj, S., Jain, L., Jain, S.: Cloud Computing: A Study of Infrastructure as a Service (IAAS). IJEIT 2(1), 60–63 (2012)

    Google Scholar 

  2. Yingchun, Y., Xiaoping, L., Qian, W., Xia, Z.: Deadline Division-based Heuristic for Cost Optimization in Workflow Scheduling. Information Sciences 179, 2562–2575 (2009)

    Article  MATH  Google Scholar 

  3. Yu, J., Buyya, R., Ramanmohanarao, K.: Workflow Scheduling Algorithms for Grid Computing. In: Metaheuristics for Scheduling in Distributed Computing Environments, pp. 173–214. Springer, Berlin (2008)

    Chapter  Google Scholar 

  4. Hai, J., Hanhua, C., Zhipeng, L., Xiaoming, N.: QoS Optimizing Model and Solving for Composite Service in CGSP Job Manager. Chinese Journal of Computers 28(4), 578–588 (2005)

    Google Scholar 

  5. Jianning, L., Huizhong, W.: Scheduling in Grid Computing Environment Based on Genetic-algorithm. Journal of Computer Research and Development 41(12), 2190–2194 (2004)

    Google Scholar 

  6. Mingyuan, Y., Yihua, Z., Ronghua, L.: A Grid Service-Workflow Scheduling Using Hybrid Particle Swarm. Journal of Huazhong University of Science and Technology: Natural Science 36(4), 45–47 (2008)

    MATH  Google Scholar 

  7. Yu, J., Buyya, R., Tham, C.K.: Cost-Based Scheduling of Scientific Workflow Applications on Utility Grids. In: Proceedings of the 1st IEEE International Conference on e-Science and Grid Computing, pp. 140–147. IEEE Press, Melbourne (2005)

    Google Scholar 

  8. Yingchun, Y., Xiaoping, L., Qian, W., Yi, Z.: Bottom Level Based Heuristic for Workflow Scheduling in Grids. Chinese Journal of Computers 31(2), 283–290 (2008)

    Google Scholar 

  9. Abrishami, S., Naghibzadeh, M.: Epema. Cost-Driven Scheduling of Grid Workflows Using Partial Critical Paths. IEEE Transactions on Parallel and Distributed Systems 23(8), 1400–1414 (2012)

    Article  Google Scholar 

  10. Amalarethinam, D.I.G., Selvi, F.K.M.: A Minimun Makespan Grid Workflow Scheduling algorithm. Computer Communication and Informatics, 1–6 (2012)

    Google Scholar 

  11. Blythe, J., Jain, S., Deelman, E., et al.: Task Scheduling Strategies for Workflow-based Applications in Grids. In: Proceedings of the IEEE International Symposium on Cluster Computing and Grid, Cardiff, Wales, UK, pp. 759–767 (2005)

    Google Scholar 

  12. Demeulemester, E., Herroelen, W., Elmaghraby, S.E.: Optimal procedures for the discrete time/cost trade-off problem in project networks. European Journal of Operational Research 88(1), 50–68 (1996)

    Article  Google Scholar 

  13. Sulistio, A., Buyya, R.: A Gird Simulation Infrastructure Supporting Advance Reservation. In: 16th International Conference on Parallel and Distributed Computing and Systems (PDCS 2004). MIT Cambridge, Boston (2004)

    Google Scholar 

  14. Henan, Z., Sakellariou, R.: A Low-cost Rescheduling Policy for Dependent Tasks on Grid Computing Systems, pp. 21–31. Springer, Berlin (2004)

    Google Scholar 

  15. Zhifeng, Y., Weisong, S.: An Adaptive Rescheduling Strategy for Gird Workflow Applications. In: Proc. of the International Symposium on Parallel and Distributed Processing. IEEE Press, New York (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Tan, W., Lu, G., Sun, Y., Zhang, Z. (2014). A Concurrent Level Based Scheduling for Workflow Applications within Cloud Computing Environment. In: Zu, Q., Vargas-Vera, M., Hu, B. (eds) Pervasive Computing and the Networked World. ICPCA/SWS 2013. Lecture Notes in Computer Science, vol 8351. Springer, Cham. https://doi.org/10.1007/978-3-319-09265-2_41

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-09265-2_41

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-09264-5

  • Online ISBN: 978-3-319-09265-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics