{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,28]],"date-time":"2026-02-28T05:11:33Z","timestamp":1772255493784,"version":"3.50.1"},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T00:00:00Z","timestamp":1701907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"name":"the\u00a0Key\u00a0Research\u00a0and\u00a0Development\u00a0Program\u00a0of\u00a0Shaanxi\u00a0Province","award":["2021ZDLGY05-05"],"award-info":[{"award-number":["2021ZDLGY05-05"]}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[2024,5]]},"DOI":"10.1007\/s11227-023-05788-x","type":"journal-article","created":{"date-parts":[[2023,12,7]],"date-time":"2023-12-07T20:01:55Z","timestamp":1701979315000},"page":"9353-9383","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A critical path task scheduling algorithm based on sequential failure factor"],"prefix":"10.1007","volume":"80","author":[{"given":"Yi\u2019an","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Jie","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Lian","family":"Li","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,12,7]]},"reference":[{"issue":"8","key":"5788_CR1","first-page":"1860","volume":"71","author":"F Guan","year":"2021","unstructured":"Guan F, Peng L, Qiao J (2021) A fluid scheduling algorithm for DAG tasks with constrained or arbitrary deadlines. IEEE Trans Comput 71(8):1860\u20131873","journal-title":"IEEE Trans Comput"},{"issue":"10","key":"5788_CR2","doi-asserted-by":"publisher","first-page":"2283","DOI":"10.1109\/TPDS.2019.2910525","volume":"30","author":"Q He","year":"2019","unstructured":"He Q, Guan N, Guo Z (2019) Intra-task priority assignment in real-time scheduling of DAG tasks on multi-cores. IEEE Trans Parallel Distrib Syst 30(10):2283\u20132295","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5788_CR3","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/s11227-020-03281-3","volume":"77","author":"R Ramezani","year":"2021","unstructured":"Ramezani R (2021) Dynamic scheduling of task graphs in multi-FPGA systems using critical path. J Supercomput 77:597\u2013618","journal-title":"J Supercomput"},{"key":"5788_CR4","doi-asserted-by":"crossref","unstructured":"Zhao S, Dai X, Bate I, Burns A, Chang W (2020) DAG scheduling and analysis on multiprocessor systems: exploitation of parallelism and dependency. In: 2020 IEEE Real-Time Systems Symposium (RTSS). IEEE, pp 128\u2013140","DOI":"10.1109\/RTSS49844.2020.00022"},{"issue":"3","key":"5788_CR5","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1023\/A:1015617019423","volume":"5","author":"J Frey","year":"2002","unstructured":"Frey J, Tannenbaum T, Foster I, Livny M, Tuecke S (2002) Condor-G: a computation management agent for multi-institutional grids. Cluster Comput 5(3):237\u2013246","journal-title":"Cluster Comput"},{"key":"5788_CR6","doi-asserted-by":"crossref","unstructured":"Zheng W, Tang L, Sakellariou R (2015) A priority-based scheduling heuristic to maximize parallelism of ready tasks for DAG applications. In: 2015 15th IEEE\/ACM International Symposium on Cluster, Cloud and Grid Computing. IEEE, pp 596\u2013605","DOI":"10.1109\/CCGrid.2015.97"},{"issue":"11","key":"5788_CR7","doi-asserted-by":"publisher","first-page":"1023","DOI":"10.1109\/TC.1984.1676376","volume":"33","author":"H Kasahara","year":"1984","unstructured":"Kasahara H, Narita S (1984) Practical multiprocessor scheduling algorithms for efficient parallel processing. IEEE Trans Comput 33(11):1023\u20131029","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"5788_CR8","first-page":"216","volume":"27","author":"S-E Zhou","year":"2004","unstructured":"Zhou S-E, Yuan Y-G, Xiong B-Z, Ou Z-H (2004) A processor preallocation algorithm based on task replication. J Comput Sci Technol 27(2):216\u2013223 (in Chinese)","journal-title":"J Comput Sci Technol"},{"key":"5788_CR9","doi-asserted-by":"crossref","unstructured":"Saito Y, Sato F, Azumi T, Kato S, Nishio N (2018) ROSCH: real-time scheduling framework for ROS. In: 2018 IEEE 24th International Conference on Embedded and Real-Time Computing Systems and Applications (RTCSA). IEEE, pp 52\u201358","DOI":"10.1109\/RTCSA.2018.00015"},{"issue":"2","key":"5788_CR10","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s11241-021-09375-2","volume":"58","author":"P Voudouris","year":"2022","unstructured":"Voudouris P, Stenstr\u00f6m P, Pathan R (2022) Bounding the execution time of parallel applications on unrelated multiprocessors. Real-Time Syst 58(2):189\u2013232","journal-title":"Real-Time Syst"},{"issue":"4","key":"5788_CR11","doi-asserted-by":"publisher","first-page":"915","DOI":"10.1109\/TPDS.2017.2777449","volume":"29","author":"R Pathan","year":"2017","unstructured":"Pathan R, Voudouris P, Stenstr\u00f6m P (2017) Scheduling parallel real-time recurrent tasks on multicore platforms. IEEE Trans Parallel Distrib Syst 29(4):915\u2013928","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"1","key":"5788_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3494537","volume":"19","author":"MW Azhar","year":"2022","unstructured":"Azhar MW, Pericas M, Stenstr\u00f6m P (2022) Task-RM: a resource manager for energy reduction in task-parallel applications under quality of service constraints. ACM Trans Arch Code Optim (TACO) 19(1):1\u201326","journal-title":"ACM Trans Arch Code Optim (TACO)"},{"key":"5788_CR13","doi-asserted-by":"crossref","unstructured":"Verucchi M, Theile M, Caccamo, M, Bertogna M (2020) Latency-aware generation of single-rate DAGs from multi-rate task sets. In: 2020 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, pp 226\u2013238","DOI":"10.1109\/RTAS48715.2020.000-4"},{"key":"5788_CR14","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2022.102947","volume":"112","author":"W Shi","year":"2022","unstructured":"Shi W, Li H, Guan J, Zeng H (2022) Energy-efficient scheduling algorithms based on task clustering in heterogeneous spark clusters. Parallel Comput 112:102947","journal-title":"Parallel Comput"},{"key":"5788_CR15","doi-asserted-by":"crossref","unstructured":"Fan W, Zhu J, Ding K (2022) An improved task duplication based clustering algorithm for dag task scheduling in heterogenous and distributed systems. In 2022 IEEE international conference on systems, man, and cybernetics (SMC). IEEE, pp. 878\u2013883","DOI":"10.1109\/SMC53654.2022.9945255"},{"key":"5788_CR16","first-page":"659","volume":"30","author":"A Yano","year":"2022","unstructured":"Yano A, Azumi T (2022) CQGA-HEFT: Q-learning-based DAG scheduling algorithm using genetic algorithm in clustered many-core platform. J Inf Process 30:659\u2013668","journal-title":"J Inf Process"},{"key":"5788_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2019.101704","volume":"105","author":"S Chang","year":"2020","unstructured":"Chang S, Zhao X, Liu Z, Deng Q (2020) Real-time scheduling and analysis of parallel tasks on heterogeneous multi-cores. J Syst Arch 105:101704","journal-title":"J Syst Arch"},{"key":"5788_CR18","doi-asserted-by":"publisher","first-page":"404","DOI":"10.1007\/s11241-012-9166-9","volume":"49","author":"A Saifullah","year":"2013","unstructured":"Saifullah A, Li J, Agrawal K, Lu C, Gill C (2013) Multi-core real-time scheduling for generalized parallel task models. Real-Time Syst 49:404\u2013435","journal-title":"Real-Time Syst"},{"issue":"8","key":"5788_CR19","doi-asserted-by":"publisher","first-page":"1400","DOI":"10.1109\/TPDS.2011.303","volume":"23","author":"S Abrishami","year":"2011","unstructured":"Abrishami S, Naghibzadeh M, Epema DH (2011) Cost-driven scheduling of grid workflows using partial critical paths. IEEE Trans Parallel Distrib Syst 23(8):1400\u20131414","journal-title":"IEEE Trans Parallel Distrib Syst"},{"issue":"3","key":"5788_CR20","doi-asserted-by":"publisher","first-page":"260","DOI":"10.1109\/71.993206","volume":"13","author":"H Topcuoglu","year":"2002","unstructured":"Topcuoglu H, Hariri S, Wu MY (2002) Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Trans Parallel Distrib Syst 13(3):260\u2013274","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"5788_CR21","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1007\/s11241-018-09325-5","volume":"55","author":"J Fonseca","year":"2019","unstructured":"Fonseca J, Nelissen G, N\u00e9lis V (2019) Schedulability analysis of DAG tasks with arbitrary deadlines under global fixed-priority scheduling. Real-Time Syst 55:387\u2013432","journal-title":"Real-Time Syst"},{"key":"5788_CR22","doi-asserted-by":"crossref","unstructured":"Fonseca J, Nelissen G, N\u00e9lis V (2017) Improved response time analysis of sporadic DAG tasks for global FP scheduling. In: Proceedings of the 25th International Conference on Real-Time Networks and Systems, pp 28\u201337","DOI":"10.1145\/3139258.3139288"},{"issue":"08","key":"5788_CR23","doi-asserted-by":"publisher","first-page":"2250150","DOI":"10.1142\/S021812662250150X","volume":"31","author":"L Qiao","year":"2022","unstructured":"Qiao L, Yang M, Chen Z, Liao Y, Lei H, Sang N (2022) Global fixed-priority scheduling for parallel real-time tasks with constrained parallelism. J Circuits Syst Comput 31(08):2250150","journal-title":"J Circuits Syst Comput"},{"issue":"5","key":"5788_CR24","doi-asserted-by":"publisher","first-page":"1077","DOI":"10.1109\/TC.2021.3071730","volume":"71","author":"Y Cho","year":"2021","unstructured":"Cho Y, Kim DH, Park D, Lee SS, Lee CG (2021) Optimal parallelization of single\/multi-segment real-time tasks for global EDF. IEEE Trans Comput 71(5):1077\u20131091","journal-title":"IEEE Trans Comput"},{"key":"5788_CR25","doi-asserted-by":"publisher","DOI":"10.3724\/SP.J.1016.2015.00999","author":"S Huang","year":"2015","unstructured":"Huang S, Zhu Y, Li B, Lu W (2015) A real-time scheduling method for periodic tasks with dependencies. J Comput Sci Technol. https:\/\/doi.org\/10.3724\/SP.J.1016.2015.00999. (in Chinese)","journal-title":"J Comput Sci Technol"},{"issue":"12","key":"5788_CR26","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1145\/361604.361619","volume":"17","author":"TL Adam","year":"1974","unstructured":"Adam TL, Chandy KM, Dickson JR (1974) A comparison of list schedules for parallel processing systems. Commun ACM 17(12):685\u2013690","journal-title":"Commun ACM"},{"key":"5788_CR27","doi-asserted-by":"crossref","unstructured":"Jiang X, Guan N, Long X, Yi W (2017) Semi-federated scheduling of parallel real-time tasks on multiprocessors. In: 2017 IEEE Real-Time Systems Symposium (RTSS). IEEE, pp 80\u201391","DOI":"10.1109\/RTSS.2017.00015"},{"key":"5788_CR28","doi-asserted-by":"crossref","unstructured":"Guo Z, Bhuiyan A, Liu D, Khan A, Saifullah A, Guan N (2019) Energy-efficient real-time scheduling of DAGs on clustered multi-core platforms. In: 2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS). IEEE, pp 156\u2013168","DOI":"10.1109\/RTAS.2019.00021"},{"issue":"5","key":"5788_CR29","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3241049","volume":"17","author":"A Bhuiyan","year":"2018","unstructured":"Bhuiyan A, Guo Z, Saifullah A, Guan N, Xiong H (2018) Energy-efficient real-time scheduling of DAG tasks. ACM Trans Embedded Comput Syst (TECS) 17(5):1\u201325","journal-title":"ACM Trans Embedded Comput Syst (TECS)"},{"key":"5788_CR30","doi-asserted-by":"crossref","unstructured":"Cordasco G, De Chiara R, Rosenberg AL (2011) Assessing the computational benefits of AREA-oriented DAG-scheduling. In: Euro-Par (1), pp 180\u2013192","DOI":"10.1007\/978-3-642-23400-2_18"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05788-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-023-05788-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-023-05788-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,4,18]],"date-time":"2024-04-18T13:30:19Z","timestamp":1713447019000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-023-05788-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,7]]},"references-count":30,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2024,5]]}},"alternative-id":["5788"],"URL":"https:\/\/doi.org\/10.1007\/s11227-023-05788-x","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,12,7]]},"assertion":[{"value":"3 November 2023","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 December 2023","order":2,"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 no competing interests.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Competing interests"}}]}}