Advertisement

A Phased Workflow Scheduling Scheme with Task Division Policy in Cloud Broker

  • Seong-Hwan KimEmail author
  • Kyung-No Joo
  • Yun-Gi Ha
  • Gyu-Beom Choi
  • Chan-Hyun Youn
Conference paper
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 142)

Abstract

In the science area, workflow management systems (WMS) coordinate collaborative tasks between researchers of many research organizations. Also, WMS effectively compose the high performance computing system with globally distributed computing resources. In addition, with the maturity of cloud computing technology, many researches try to enhancing the economic feasibility and system tolerability. While executing a workflow application, a workflow scheduler, which is in WMS, should recognize the dynamic status of resources and decide to assign appropriate resource on each task. With the negotiation procedure, users can ask for saving processing cost or shortening completion time. However, satisfying these multiple objectives at the same time is hard to achieve. Therefore, the existing workflow scheduling schemes try to find the near optimal solution with heuristic approaches. In this paper, we propose heuristic workflow scheduling scheme with petri-net workflow modeling, resource type mapping in accordance to workload ratio and policy based task division to guarantee the deadline constraint with minimum budget consumption.

Keywords

Workflow scheduling Colored patri-net Task division policy Cloud computing 

Notes

Acknowledgments

This work was supported by the ICT R&D program of MSIP/IITP[10038768, The Development of Supercomputing System for the Genome Analysis] and ‘The Cross-Ministry Giga KOREA Project’ of The Ministry of Science, ICT and Future Planning, Korea. [GK13P0100, Development of Tele-Experience Service SW Platform based on Giga Media].

References

  1. 1.
    Jeong, S., Jo, Y.M., et al.: A novel model for metabolic syndrome risk quantification based on areal similarity degree. IEEE Trans. Biomed. Engi. 61(3), 665–679 (2014)CrossRefGoogle Scholar
  2. 2.
    Ren, Y., Kim, S.-H., et al.: A cost-efficient job scheduling algorithm in cloud resource broker with scalable VM allocation scheme. KIPS Trans. Softw. Data Eng. 1(3), 137–148 (2012)CrossRefGoogle Scholar
  3. 3.
    Yu, J., Buyya, R., Tham, C.K.: Cost-based scheduling of scientific workflow applications on utility grids. In: First International Conference on e-Science and Grid Computing, pp. 8–147. IEEE (2005)Google Scholar
  4. 4.
    Kim, D.-S.: Adaptive workflow scheduling scheme based on the colored petri-net model in cloud. Master’s thesis. KAIST, Daejeon, Korea (2014)Google Scholar
  5. 5.
    Wu, L., et al.: SLA-based resource allocation for software as a service provider (SaaS) in cloud computing environments. In: 11th IEEE/ACM International Symposium on Cluster, Cloud and Grid Computing (CCGrid), pp. 195–204. IEEE (2011)Google Scholar
  6. 6.
    Bharadwaj, V., et al.: Divisible load theory: a new paradigm for load scheduling in distributed systems. Cluster Comput. 6(1), 7–17 (2003)CrossRefMathSciNetGoogle Scholar
  7. 7.
    Kelley Jr., J.E.: Critical-path planning and scheduling: mathematical basis. Oper. Res. 9(3), 296–320 (1961)CrossRefzbMATHMathSciNetGoogle Scholar

Copyright information

© Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2015

Authors and Affiliations

  • Seong-Hwan Kim
    • 1
    Email author
  • Kyung-No Joo
    • 1
  • Yun-Gi Ha
    • 1
  • Gyu-Beom Choi
    • 1
  • Chan-Hyun Youn
    • 1
  1. 1.Department of Electrical EngineeringKAISTDaejeonKorea

Personalised recommendations