Deep reinforcement learning-based algorithms selectors for the resource scheduling in hierarchical Cloud computing

被引:14
作者
Zhou G. [1 ]
Wen R. [1 ]
Tian W. [1 ]
Buyya R. [1 ,2 ]
机构
[1] School of Information and Software Engineering, University of Electronic Science and Technology of China
[2] Cloud Computing and Distributed Systems Lab, School of Computing and Information Systems, The University of Melbourne
基金
中国国家自然科学基金;
关键词
Algorithm selection; DL-based selector; DRL-based selector; Hierarchical cloud computing; Subsystem;
D O I
10.1016/j.jnca.2022.103520
中图分类号
学科分类号
摘要
Cloud computing environment is becoming increasingly complex due to its large-scale information growth and increasing heterogeneity of computing resources. Hierarchical Cloud computing dividing the system into multi-levels with multiple subsystems to support the adaptability to abundant requests from users has been widely applied and brings great challenges to resource scheduling. It is critical to find an effective way to address the complex scheduling problems in hierarchical Cloud computing, whose scenarios and optimization objectives often change with the types of subsystems. In this paper, we propose a scheduling framework to select the scheduling algorithms (SFSSA) for different scheduling scenarios considering no algorithm well suitable to all scenarios. To concretize SFSSA, we propose deep learning-based algorithms selectors (DLS) trained by labeled data and deep reinforcement learning-based algorithms selectors (DRLS) trained by feedback from dynamic scenarios to complete the algorithms selection regarding the scheduling algorithms as selectable tools. Then, we apply strategies including pre-trained model, long experience reply and joint training to improve the performance of DRLS. To enable the quantitative comparison of selectors, we introduce a weighted cost model for the trade-off between solution and complexity. Through multiple sets of experiments in hierarchical Cloud computing with multi subsystems for five types of scheduling problems and varying weights of cost, we demonstrate DLS and DRLS outperform baseline strategies. Compared with random selector, greedy selector, round-robin selector, single best selector, virtual best selector and single fast selector, DLS reduces the cost by 47.4%, 46.1%, 33.9%, 47.9%, 19.3%, 18.8% under stable parameter ranges, and DRLS reduces the cost by 41.1%, 40.6%, 11.7%, 42.3%, 11.5%, 12.5% in dynamic scenarios respectively. In experiments, we also validate DRLS has stronger adaptability than DLS in dynamic scheduling scenarios and DRLS using all of strategies achieves the best performance. © 2022 Elsevier Ltd
引用
收藏
相关论文
共 45 条
[1]  
Abhikriti N., Sunita D., Enhanced task scheduling algorithm using multi-objective function for cloud computing framework, International Conference on Next Generation Computing Technologies, pp. 110-121, (2017)
[2]  
Adhikari M., Amgoth T., Srirama S.N., A survey on scheduling strategies for workflows in cloud environment and emerging trends, ACM Comput. Surv., 52, 4, pp. 681-68:36, (2019)
[3]  
Al-Mahruqi A.A.H., Morison G., Stewart B.G., Vallavaraj A., Hybrid heuristic algorithm for better energy optimization and resource utilization in cloud computing, Wirel. Pers. Commun., 118, 1, pp. 43-73, (2021)
[4]  
Armbrust M., Fox A., Griffith R., Joseph A.D., Katz R.H., Konwinski A., Lee G., Patterson D.A., Rabkin A., Stoica I., Zaharia M., A view of cloud computing, Commun. ACM, 53, 4, pp. 50-58, (2010)
[5]  
Boas M.G.V., Santos H.G., de Campos Merschmann L.H., Berghe G.V., Optimal decision trees for the algorithm selection problem: integer programming based approaches, Int. Trans. Oper. Res., 28, 5, pp. 2759-2781, (2021)
[6]  
Croce F.D., Scatamacchia R., The longest processing time rule for identical parallel machines revisited, J. Sched., 23, 2, pp. 163-176, (2020)
[7]  
Czako Z., Sebestyen G., Hangan A., AutomaticaI - A hybrid approach for automatic artificial intelligence algorithm selection and hyperparameter tuning, Expert Syst. Appl., 182, (2021)
[8]  
Deshpande N., Sharma N., Yu Q., Krutz D.E., R-CASS: using algorithm selection for self-adaptive service oriented systems, 2021 IEEE International Conference on Web Services, ICWS 2021, Chicago, IL, USA, September 5-10, 2021, pp. 61-72, (2021)
[9]  
Ding D., Fan X., Zhao Y., Kang K., Yin Q., Zeng J., Q-learning based dynamic task scheduling for energy-efficient cloud computing, Future Gener. Comput. Syst., 108, pp. 361-371, (2020)
[10]  
Dong T., Xue F., Xiao C., Li J., Task scheduling based on deep reinforcement learning in a cloud manufacturing environment, Concurr. Comput. Pract. Exp., 32, 11, (2020)