Advertisement

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

  • Wen’an Tan
  • Guangzhen Lu
  • Yong Sun
  • Zijian Zhang
Part of the Lecture Notes in Computer Science book series (LNCS, 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.

Keywords

workflow scheduling cost/time tradeoff heuristics concurrent level 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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. 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)CrossRefzbMATHGoogle Scholar
  3. 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)CrossRefGoogle Scholar
  4. 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. 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. 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)zbMATHGoogle Scholar
  7. 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. 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. 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)CrossRefGoogle Scholar
  10. 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. 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. 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)CrossRefGoogle Scholar
  13. 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. 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. 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

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  • Wen’an Tan
    • 1
    • 2
  • Guangzhen Lu
    • 1
  • Yong Sun
    • 1
  • Zijian Zhang
    • 1
  1. 1.School of Computer Science and TechnologyNanjing University of Aeronautics and AstronauticsNanjingChina
  2. 2.School of Computer and InformationShanghai Second Polytechnic UniversityShanghaiChina

Personalised recommendations