Abstract
With the increasing popularity of cloud computing technology, the traditional Business Process Management System (BPMS) begins to transform to the architecture that deployed in the cloud. Since the traditional BPMS is often implemented as a stateful single-instance architecture, the cloud BPMS providers will encounter the stateful service load scheduling problem when they refactor the traditional BPMS to the microservice architecture that deployed on the cloud server. In order to help realize the transformation of traditional BPMS and improve the load capacity of cloud BPMS with limited computing resources, we propose a heuristic load scheduling algorithm for stateful service scheduling. The algorithm makes use of the busyness metrics of the single BPMS engine instance microservice in the cloud BPMS architecture. Because the resource scheduling problem is always defined as online bin packing problem, we improve the Best-Fit algorithm to solve this kind of problem. We come up with the Best-Fit Decreasing algorithm based on cloud BPMS engine busyness measuring and load prediction to schedule the computing resources to business process instances. Compared to some common load scheduling algorithms, our algorithm help cloud BPMS increase load level by at least 15%.
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
References
Foster, I., et al.: Modeling stateful resources with web services. Globus Alliance (2004)
White, J.G.: U.S. Patent No. 6,065,117. Patent and Trademark Office, Washington, DC. U.S (2000)
Karagiannis, D.: BPMS: business process management systems. ACM SIGOIS Bull. 16(1), 10–13 (1995)
Hollingsworth, D., Hampshire, U.K.: Workflow management coalition: The workflow reference model. Document Number TC00-1003, vol. 19, p. 16 (1995)
Jordan, D., et al.: Web services business process execution language version 2.0. OASIS Stan. 11(120), 5 (2007)
Van Der Aalst, W.M., Ter Hofstede, A.H.: YAWL: yet another workflow language. Inf. Syst. 30(4), 245–275 (2005)
Aalst, W.M.P.: Making work flow: on the application of petri nets to business process management. In: Esparza, J., Lakos, C. (eds.) ICATPN 2002. LNCS, vol. 2360, pp. 1–22. Springer, Heidelberg (2002). https://doi.org/10.1007/3-540-48068-4_1
Ouyang, C., Adams, M., ter Hofstede, A.H.M., Yu, Y.: Towards the design of a scalable business process management system architecture in the cloud. In: Trujillo, J.C., et al. (eds.) ER 2018. LNCS, vol. 11157, pp. 334–348. Springer, Cham (2018). https://doi.org/10.1007/978-3-030-00847-5_24
Rosinosky, G., Youcef, S., Charoy, F.: Efficient migration-aware algorithms for elastic BPMaaS. In: Carmona, J., Engels, G., Kumar, A. (eds.) BPM 2017. LNCS, vol. 10445, pp. 147–163. Springer, Cham (2017). https://doi.org/10.1007/978-3-319-65000-5_9
Rosinosky, G., Youcef, S., Charoy, F.: An efficient approach for multi-tenant elastic business processes management in cloud computing environment. In: 2016 IEEE 9th International Conference on Cloud Computing (CLOUD), pp. 311–318. IEEE, June 2016
Schmidt, R.: Scalable business process enactment in cloud environments. In: Bider, I., Halpin, T., et al. (eds.) BPMDS/EMMSAD -2012. LNBIP, vol. 113, pp. 1–15. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31072-0_1
Paschek, D., Trusculescu, A., Mateescu, A., Draghici, A.: Business process as a service-a flexible approach for it service management and business process outsourcing. In: Management Challenges in a Network Economy: Proceedings of the MakeLearn and TIIM International Conference, pp. 195–203 (2017)
Pathirage, M., Perera, S., Kumara, I., Weerawarana, S.: A multi-tenant architecture for business process executions. In: 2011 IEEE International Conference on Web Services, pp. 121–128. IEEE, July 2011
Ray, S., De Sarkar, A.: Execution analysis of load balancing algorithms in cloud computing environment. Int. J. Cloud Comput. Serv. Architect. (IJCCSA) 2(5), 1–13 (2012)
De La Vega, W.F., Lueker, G.S.: Bin packing can be solved within 1 + ε in linear time. Combinatorica 1(4), 349–355 (1981)
Kenyon, C.: Best-fit bin-packing with random order. In: SODA, vol. 96, pp. 359–364, January 1996
RenWFMS: Business Object Oriented Workflow Environment. https://github.com/SYSU-Workflow-Lab/RenWFMS
Gatling load testing. https://gatling.io/
Kansal, N.J., Chana, I.: Cloud load balancing techniques: a step towards green computing. IJCSI Int. J. Comput. Sci. Issues 9(1), 238–246 (2012)
Acknowledgements
This work is Supported by the National Key Research and Development Program of China under Grant No. 2017YFB0202200; the National Natural Science Foundation of China under Grant Nos. 61972427, 61572539; the Research Foundation of Science and Technology Plan Project in Guangzhou City under Grant No. 201704020092.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2020 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Zhang, H., Yu, Y., Pan, M. (2020). Heuristic Load Scheduling Algorithm for Stateful Cloud BPM Engine. In: Shen, H., Sang, Y. (eds) Parallel Architectures, Algorithms and Programming. PAAP 2019. Communications in Computer and Information Science, vol 1163. Springer, Singapore. https://doi.org/10.1007/978-981-15-2767-8_20
Download citation
DOI: https://doi.org/10.1007/978-981-15-2767-8_20
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-15-2766-1
Online ISBN: 978-981-15-2767-8
eBook Packages: Computer ScienceComputer Science (R0)