{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:31:08Z","timestamp":1760711468895,"version":"3.41.0"},"reference-count":24,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T00:00:00Z","timestamp":1741478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T00:00:00Z","timestamp":1741478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["2023YFB3001504"],"award-info":[{"award-number":["2023YFB3001504"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["CCF Trans. HPC"],"published-print":{"date-parts":[[2025,6]]},"DOI":"10.1007\/s42514-024-00207-w","type":"journal-article","created":{"date-parts":[[2025,3,9]],"date-time":"2025-03-09T12:55:07Z","timestamp":1741524907000},"page":"179-193","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["KANETAS: an elastic scheduler for heterogeneous many-core systems"],"prefix":"10.1007","volume":"7","author":[{"given":"Zhao","family":"Mao","sequence":"first","affiliation":[]},{"given":"Xingjun","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Longxiang","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,3,9]]},"reference":[{"key":"207_CR1","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/j.knosys.2019.01.023","volume":"169","author":"M Abd Elaziz","year":"2019","unstructured":"Abd Elaziz, M., Xiong, S., Jayasena, K., Li, L.: Task scheduling in cloud computing based on hybrid moth search algorithm and differential evolution. Knowl.-Based Syst. 169, 39\u201352 (2019). https:\/\/doi.org\/10.1016\/j.knosys.2019.01.023","journal-title":"Knowl.-Based Syst."},{"issue":"4","key":"207_CR2","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1049\/iet-cdt.2018.5220","volume":"14","author":"MAN Al-hayanni","year":"2020","unstructured":"Al-hayanni, M.A.N., Xia, F., Rafiev, A., Romanovsky, A., Shafik, R., Yakovlev, A.: Amdahl\u2019s law in the context of heterogeneous many-core systems\u2013a survey. IET Comput. Digital Tech. 14(4), 133\u2013148 (2020). https:\/\/doi.org\/10.1049\/iet-cdt.2018.5220","journal-title":"IET Comput. Digital Tech."},{"key":"207_CR3","doi-asserted-by":"crossref","unstructured":"Alworafi, M. A., Dhari, A., Al-Hashmi, A. A., & Darem, A. B. (2016) An improved SJF scheduling algorithm in cloud computing environment 2016 International Conference on Electrical, Electronics, Communication, Computer and Optimization Techniques (ICEECCOT). IEEE, pp. 208\u2013212.","DOI":"10.1109\/ICEECCOT.2016.7955216"},{"key":"207_CR4","doi-asserted-by":"crossref","unstructured":"Augonnet, C., Thibault, S., Namyst, R., & Wacrenier, P.-A. (2009) StarPU: a unified platform for task scheduling on heterogeneous multicore architectures Euro-Par 2009 Parallel Processing: 15th International Euro-Par Conference, Delft, The Netherlands, August 25\u201328, 2009. Proceedings 15. Springer, pp. 863\u2013874.","DOI":"10.1007\/978-3-642-03869-3_80"},{"key":"207_CR5","doi-asserted-by":"crossref","unstructured":"Casanova, H., Legrand, A., & Quinson, M. (2008) Simgrid: A generic framework for large-scale distributed experiments Tenth International Conference on Computer Modeling and Simulation (uksim 2008). IEEE, pp. 126\u2013131.","DOI":"10.1109\/UKSIM.2008.28"},{"issue":"4","key":"207_CR6","doi-asserted-by":"publisher","first-page":"399","DOI":"10.1016\/j.jpdc.2007.05.015","volume":"68","author":"MI Daoud","year":"2008","unstructured":"Daoud, M.I., Kharma, N.: A high performance algorithm for static task scheduling in heterogeneous distributed computing systems. Journal of Parallel and Distributed Computing 68(4), 399\u2013409 (2008). https:\/\/doi.org\/10.1016\/j.jpdc.2007.05.015","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"207_CR7","doi-asserted-by":"crossref","unstructured":"Grinsztajn, N., Beaumont, O., Jeannot, E., & Preux, P. (2021) Readys: A reinforcement learning based strategy for heterogeneous dynamic scheduling 2021 IEEE International Conference on Cluster Computing (CLUSTER). IEEE, pp. 70\u201381.","DOI":"10.1109\/Cluster48925.2021.00031"},{"key":"207_CR8","doi-asserted-by":"crossref","unstructured":"Gupta, I., Kumar, M. S., & Jana, P. K. (2016) Task duplication-based workflow scheduling for heterogeneous cloud environment 2016 Ninth International Conference on Contemporary Computing (IC3). IEEE, pp. 1\u20137.","DOI":"10.1109\/IC3.2016.7880207"},{"issue":"1","key":"207_CR9","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1109\/TPDS.2018.2851221","volume":"30","author":"K He","year":"2018","unstructured":"He, K., Meng, X., Pan, Z., Yuan, L., Zhou, P.: A novel task-duplication based clustering algorithm for heterogeneous computing environments. IEEE Trans. Parallel Distrib. Syst. 30(1), 2\u201314 (2018). https:\/\/doi.org\/10.1109\/TPDS.2018.2851221","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"issue":"4","key":"207_CR10","doi-asserted-by":"publisher","first-page":"406","DOI":"10.1145\/344588.344618","volume":"31","author":"Y-K Kwok","year":"1999","unstructured":"Kwok, Y.-K., Ahmad, I.: Static scheduling algorithms for allocating directed task graphs to multiprocessors. ACM Computing Surveys (CSUR) 31(4), 406\u2013471 (1999). https:\/\/doi.org\/10.1145\/344588.344618","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"207_CR11","unstructured":"Leung, J. Y. (2004). Handbook of scheduling: algorithms, models, and performance analysis. Chapman and Hall\/CRC."},{"key":"207_CR12","doi-asserted-by":"publisher","unstructured":"Lin, Z., Li, C., Tian, L., & Zhang, B. (2022). A scheduling algorithm based on reinforcement learning for heterogeneous environments. Applied Soft Computing Journal, 130. https:\/\/doi.org\/10.1016\/j.asoc.2022.109707","DOI":"10.1016\/j.asoc.2022.109707"},{"key":"207_CR13","doi-asserted-by":"crossref","unstructured":"Mayer, R., Mayer, C., & Laich, L. (2017) The tensorflow partitioning and scheduling problem: it's the critical path! Proceedings of the 1st Workshop on Distributed Infrastructures for Deep Learning. pp. 1\u20136.","DOI":"10.1145\/3154842.3154843"},{"key":"207_CR14","unstructured":"Mirhoseini, A., Pham, H., Le, Q. V., Steiner, B., Larsen, R., Zhou, Y., et al. (2017) Device placement optimization with reinforcement learning International conference on machine learning. PMLR, pp. 2430\u20132439."},{"key":"207_CR15","doi-asserted-by":"publisher","first-page":"292","DOI":"10.1016\/j.jpdc.2017.05.001","volume":"117","author":"AI Orhean","year":"2018","unstructured":"Orhean, A.I., Pop, F., Raicu, I.: New scheduling approach using reinforcement learning for heterogeneous distributed systems. Journal of Parallel and Distributed Computing 117, 292\u2013302 (2018). https:\/\/doi.org\/10.1016\/j.jpdc.2017.05.001","journal-title":"Journal of Parallel and Distributed Computing"},{"key":"207_CR16","doi-asserted-by":"publisher","unstructured":"Singh, B., & Mehta, P. (2016). A survey of scheduling algorithms for heterogeneous systems and comparative study of HEFT and CPOP algorithms. algorithms, 15, 20. https:\/\/doi.org\/10.17577\/ijertv5is050045","DOI":"10.17577\/ijertv5is050045"},{"key":"207_CR17","doi-asserted-by":"crossref","unstructured":"Singh, J., Mangipudi, B., Betha, S., & Auluck, N. (2012) Restricted duplication based milp formulation for scheduling task graphs on unrelated parallel machines 2012 Fifth International Symposium on Parallel Architectures, Algorithms and Programming. IEEE, pp. 202\u2013209.","DOI":"10.1109\/PAAP.2012.37"},{"issue":"2","key":"207_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.5120\/ijca2015906828","volume":"129","author":"K Singh","year":"2015","unstructured":"Singh, K., Alam, M., Sharma, S.K.: A survey of static scheduling algorithm for distributed computing system. International Journal of Computer Applications 129(2), 25\u201330 (2015). https:\/\/doi.org\/10.5120\/ijca2015906828","journal-title":"International Journal of Computer Applications"},{"issue":"9","key":"207_CR19","doi-asserted-by":"publisher","first-page":"824","DOI":"10.1109\/TPDS.2004.38","volume":"15","author":"AS Wu","year":"2004","unstructured":"Wu, A.S., Yu, H., Jin, S., Lin, K.-C., Schiavone, G.: An incremental genetic algorithm approach to multiprocessor scheduling. IEEE Trans. Parallel Distrib. Syst. 15(9), 824\u2013834 (2004). https:\/\/doi.org\/10.1109\/TPDS.2004.38","journal-title":"IEEE Trans. Parallel Distrib. Syst."},{"key":"207_CR20","doi-asserted-by":"crossref","unstructured":"Wu, Q., Wu, Z., Zhuang, Y., & Cheng, Y. (2018) Adaptive DAG tasks scheduling with deep reinforcement learning Algorithms and Architectures for Parallel Processing: 18th International Conference, ICA3PP 2018, Guangzhou, China, November 15\u201317, 2018, Proceedings, Part II 18. Springer, pp. 477\u2013490.","DOI":"10.1007\/978-3-030-05054-2_37"},{"key":"207_CR21","unstructured":"Zaharia, M., Chowdhury, M., Das, T., Dave, A., Ma, J., McCauly, M., et al. (2012) Resilient distributed datasets: A fault-tolerant abstraction for in-memory cluster computing 9th USENIX symposium on networked systems design and implementation (NSDI 12). pp. 15\u201328."},{"key":"207_CR22","doi-asserted-by":"publisher","unstructured":"Zhou, S., Stumm, M., Li, M., & Wortman, D. (1991). Heterogeneous distributed shared memory. IEEE Trans. on Parallel and Distributed Systems, 3(5), 540\u2013554. https:\/\/doi.org\/10.1109\/71.159038","DOI":"10.1109\/71.159038"},{"key":"207_CR23","doi-asserted-by":"crossref","unstructured":"Zhou, Y., Li, X., Luo, J., Yuan, M., Zeng, J., & Yao, J. (2022) Learning to Optimize DAG Scheduling in Heterogeneous Environment 2022 23rd IEEE International Conference on Mobile Data Management (MDM), Mobile Data Management (MDM), 2022 23rd IEEE International Conference on, MDM [Conference]. IEEE, pp. 137\u2013146.","DOI":"10.1109\/MDM55031.2022.00040"},{"key":"207_CR24","doi-asserted-by":"crossref","unstructured":"Zhu, Y., & Hu, B. (2021) Smart-mDAG: An Intelligent Scheduling Method for Multi-DAG Jobs 2021 International Conference on Information and Communication Technology Convergence (ICTC), Information and Communication Technology Convergence (ICTC), 2021 International Conference on [Conference]. IEEE, pp. 110\u2013115.","DOI":"10.1109\/ICTC52510.2021.9621176"}],"container-title":["CCF Transactions on High Performance Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-024-00207-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42514-024-00207-w\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42514-024-00207-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,11]],"date-time":"2025-06-11T21:01:39Z","timestamp":1749675699000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42514-024-00207-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3,9]]},"references-count":24,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2025,6]]}},"alternative-id":["207"],"URL":"https:\/\/doi.org\/10.1007\/s42514-024-00207-w","relation":{},"ISSN":["2524-4922","2524-4930"],"issn-type":[{"type":"print","value":"2524-4922"},{"type":"electronic","value":"2524-4930"}],"subject":[],"published":{"date-parts":[[2025,3,9]]},"assertion":[{"value":"14 July 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 November 2024","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"9 March 2025","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors declare that they have no conflicts of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}