Abstract
In distributed heterogeneous computing systems, efficient algorithms are crucial for improving system performance. We know that the task scheduling problem based on Directed Acyclic Graph (DAG) has been proven to be an NP-complete problem, making it difficult to find the optimal solution. Although previous research proposed many greedy strategies to solve this problem, these algorithms often have very limited search spaces. To overcome these limitations, we propose a smart DAG task scheduling algorithm based on the Monte Carlo Tree Search (MCTS) method of multi-strategy learning. We design effective state, action, and reward functions to train agents and allow them to adaptively adjust their search strategies. Experimental results prove the effectiveness of our algorithm. Specifically, our algorithm is superior to PSLS, PEFT, and HEFT algorithms in scheduling the maximum completion time under a large number of randomly generated and real-world applications.
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
Adams, A., et al.: Learning to optimize halide with tree search and random programs. ACM Trans. Graph. (TOG) 38(4), 1–12 (2019)
Ahmad, S.G., Munir, E.U., Nisar, W.: PEGA: a performance effective genetic algorithm for task scheduling in heterogeneous systems. In: 2012 IEEE 14th International Conference on High Performance Computing and Communication & 2012 IEEE 9th International Conference on Embedded Software and Systems, pp. 1082–1087. IEEE (2012)
Arabnejad, H., Barbosa, J.G.: List scheduling algorithm for heterogeneous systems by an optimistic cost table. IEEE Trans. Parallel Distrib. Syst. 25(3), 682–694 (2013)
Arkhipov, D.I., Wu, D., Wu, T., Regan, A.C.: A parallel genetic algorithm framework for transportation planning and logistics management. IEEE Access 8, 106506–106515 (2020)
Arunarani, A., Manjula, D., Sugumaran, V.: Task scheduling techniques in cloud computing: a literature survey. Future Gener. Comput. Syst. 91, 407–415 (2019)
Best, G., Cliff, O.M., Patten, T., Mettu, R.R., Fitch, R.: DEC-MCTS: Decentralized planning for multi-robot active perception. Int. J. Rob. Res. 38(2–3), 316–337 (2019)
Bittel, L., Kliesch, M.: Training variational quantum algorithms is np-hard. Phys. Rev. Lett. 127(12), 120502 (2021)
Browne, C.B., et al.: A survey of monte carlo tree search methods. IEEE Trans. Comput. Intell. AI Games 4(1), 1–43 (2012)
Cheng, Y., Wu, Z., Liu, K., Wu, Q., Wang, Y.: Smart dag tasks scheduling between trusted and untrusted entities using the mcts method. Sustainability 11(7), 1826 (2019)
Defersha, F.M., Rooyani, D.: An efficient two-stage genetic algorithm for a flexible job-shop scheduling problem with sequence dependent attached/detached setup, machine release date and lag-time. Comput. Ind. Eng. 147, 106605 (2020)
Djigal, H., Feng, J., Lu, J., Ge, J.: IPPTS: an efficient algorithm for scientific workflow scheduling in heterogeneous computing systems. IEEE Trans. Parallel Distrib. Syst. 32(5), 1057–1071 (2020)
Hu, Z., Tu, J., Li, B.: Spear: optimized dependency-aware task scheduling with deep reinforcement learning. In: 2019 IEEE 39th International Conference on Distributed Computing Systems (ICDCS), pp. 2037–2046. IEEE (2019)
Kiran, B.R., et al.: Deep reinforcement learning for autonomous driving: a survey. IEEE Trans. Intell. Transp. Syst. 23(6), 4909–4926 (2021)
Lei, K., et al.: A multi-action deep reinforcement learning framework for flexible job-shop scheduling problem. Expert Syst. Appl. 205, 117796 (2022)
Li, K., Deng, Q., Zhang, L., Fan, Q., Gong, G., Ding, S.: An effective mcts-based algorithm for minimizing makespan in dynamic flexible job shop scheduling problem. Comput. Ind. Eng. 155, 107211 (2021)
Li, T., Sahu, A.K., Zaheer, M., Sanjabi, M., Talwalkar, A., Smith, V.: Federated optimization in heterogeneous networks. Proc. Mach. Learn. Syst. 2, 429–450 (2020)
Mao, H., Schwarzkopf, M., Venkatakrishnan, S.B., Meng, Z., Alizadeh, M.: Learning scheduling algorithms for data processing clusters. In: Proceedings of the ACM Special Interest Group on Data Communication, pp. 270–288 (2019)
Mirjalili, S., Mirjalili, S.: Genetic algorithm. In: Evolutionary Algorithms and Neural Networks: Theory and Applications, pp. 43–55 (2019)
Orhean, A.I., Pop, F., Raicu, I.: New scheduling approach using reinforcement learning for heterogeneous distributed systems. J. Parallel Distrib. Comput. 117, 292–302 (2018)
Panda, S.K., Jana, P.K.: An energy-efficient task scheduling algorithm for heterogeneous cloud computing systems. Clust. Comput. 22(2), 509–527 (2019)
Prates, M., Avelar, P.H., Lemos, H., Lamb, L.C., Vardi, M.Y.: Learning to solve np-complete problems: a graph neural network for decision tsp. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 33, pp. 4731–4738 (2019)
Schrittwieser, J., Hubert, T., Mandhane, A., Barekatain, M., Antonoglou, I., Silver, D.: Online and offline reinforcement learning by planning with a learned model. Adv. Neural. Inf. Process. Syst. 34, 27580–27591 (2021)
Silver, D., et al.: Mastering the game of go without human knowledge. Nature 550(7676), 354–359 (2017)
Topcuoglu, H., Hariri, S., Wu, M.Y.: Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans. Parallel Distrib. Syst. 13(3), 260–274 (2002)
Wu, J., Chen, X.Y., Zhang, H., Xiong, L.D., Lei, H., Deng, S.H.: Hyperparameter optimization for machine learning models based on bayesian optimization. J. Electron. Sci. Technol. 17(1), 26–40 (2019)
Yang, L., Shami, A.: On hyperparameter optimization of machine learning algorithms: theory and practice. Neurocomputing 415, 295–316 (2020)
Yao, F., Pu, C., Zhang, Z.: Task duplication-based scheduling algorithm for budget-constrained workflows in cloud computing. IEEE Access 9, 37262–37272 (2021)
Zhang, C., Song, W., Cao, Z., Zhang, J., Tan, P.S., Chi, X.: Learning to dispatch for job shop scheduling via deep reinforcement learning. Adv. Neural. Inf. Process. Syst. 33, 1621–1632 (2020)
Zhao, Y., Cao, S., Yan, L.: List scheduling algorithm based on pre-scheduling for heterogeneous computing. In: 2019 IEEE International Conference on Parallel & Distributed Processing with Applications, Big Data & Cloud Computing, Sustainable Computing & Communications, Social Computing & Networking (ISPA/BDCloud/SocialCom/SustainCom), pp. 588–595. IEEE (2019)
Zheng, W., Sakellariou, R.: Stochastic dag scheduling using a monte carlo approach. J. Parallel Distrib. Comput. 73(12), 1673–1689 (2013)
Acknowledgements
This research was funded by the Basic Public Welfare Research Project of Zhejiang Province grant number LY20F020014 and the National Science Foundation for Young Scientists of China grant number 61802096.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Shu, L. et al. (2024). Smart DAG Task Scheduling Based on MCTS Method of Multi-strategy Learning. In: Tari, Z., Li, K., Wu, H. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2023. Lecture Notes in Computer Science, vol 14487. Springer, Singapore. https://doi.org/10.1007/978-981-97-0834-5_14
Download citation
DOI: https://doi.org/10.1007/978-981-97-0834-5_14
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-97-0833-8
Online ISBN: 978-981-97-0834-5
eBook Packages: Computer ScienceComputer Science (R0)