Abstract
In Cloud broker system, workflow application requests from different users are managed through workflow scheduling and resource provisioning. In workflow scheduling phase, most existing algorithms allocate each task on certain VM in serial. In general, single task does not fully utilize allocated resource such as CPU, memory, and so on. When multiple tasks are processed with same resource in parallel, the resource utilization is improved that leads to saving the cost. In order to solve this problem, the Parallel Task Merging scheme in the same VM is proposed, which saves the cost of execution while satisfying SLA deadline. After workflow scheduling, VM resource provisioning is required. Auto-scaling VM resources approach is proposed, which adjusts the number of VMs while the number of requests varies. In this paper, we do experiment the parallel task merging and auto-scaling approaches on different environments to observe on which conditions these two approaches are working well or not.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Ren, Y.: A cloud collaboration system with active application control scheme and its experimental performance analysis. Master’s thesis, KAIST (2012)
Gary, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman and Co., New York (1979)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. (2002)
Abrishami, S., Naghibzadeh, M., Epema, D.H.J.: Deadline-constrained workflow scheduling algorithms for infrastructure as a service clouds. Future Gener. Comput. Syst. (2013). (Elsevier)
Yu, J., Buyya, R., Tham, C.K.: Cost-based scheduling of scientific workflow applications on utility grids. In: International Conference on e-Science and Grid Computing (2005)
Howard, R.A.: Dynamic Programming and Markov Processes. The Massachusetts Institute of Technology Press, Cambridge (1960)
Sakellariou, R., Zhao, H.: Scheduling workflows with budget constraints. In: Gorlatch, S., Danelutto, M. (eds.) Integrated Research in GRID Computing. CoreGRID Series. Springer, Heidelberg (2007)
Kang, D.K., Kim, S.H., Youn, C.H., Chen, M.: Cost adaptive workflow scheduling in cloud computing. In: ICUIMC. ACM (2014)
Brockwell, P.J., Davis, R.A.: Introduction to Time Series and Forecasting. Springer, New York (2002)
Fang, W., Lu, Z., Wu, J., Cao, Z.: RPPS: a novel resource prediction and provisioning scheme in cloud data center. In: IEEE Ninth International Conference on Services Computing (2012)
Kim, H., Ha, Y., Kim, Y., Joo, K.-N., Youn, C.-H.: A VM reservation-based cloud service broker and its performance evaluation. In: Leung, V.C.M., Lai, R., Chen, M., Wan, J. (eds.) CloudComp 2014. LNICST, vol. 142, pp. 43–52. Springer, Heidelberg (2015)
OpenStack. https://www.openstack.org/
Montage, An Astronomical Image Mosaic Engine. http://montage.ipac.caltech.edu/
GoGrid. https://www.datapipe.com/gogrid/
Acknowledgments
This work was supported by ‘The Cross-Ministry Giga KOREA Project’ grant from the Ministry of Science, ICT and Future Planning, Korea.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering
About this paper
Cite this paper
Yoon, D., Kim, SH., Kang, DK., Youn, CH. (2016). Hybrid Workflow Management in Cloud Broker System. In: Zhang, Y., Peng, L., Youn, CH. (eds) Cloud Computing. CloudComp 2015. Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering, vol 167. Springer, Cham. https://doi.org/10.1007/978-3-319-38904-2_15
Download citation
DOI: https://doi.org/10.1007/978-3-319-38904-2_15
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-38903-5
Online ISBN: 978-3-319-38904-2
eBook Packages: Computer ScienceComputer Science (R0)