{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T17:18:54Z","timestamp":1772212734906,"version":"3.50.1"},"reference-count":38,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T00:00:00Z","timestamp":1772150400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T00:00:00Z","timestamp":1772150400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100012166","name":"National Key Research and Development Program of China","doi-asserted-by":"publisher","award":["2021YFC2802503"],"award-info":[{"award-number":["2021YFC2802503"]}],"id":[{"id":"10.13039\/501100012166","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"DOI":"10.1007\/s11227-026-08340-9","type":"journal-article","created":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T16:26:33Z","timestamp":1772209593000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Priority list scheduling algorithm for response time analysis optimization using dependency-driven non-critical nodes parallelism factor"],"prefix":"10.1007","volume":"82","author":[{"given":"Yian","family":"Zhu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiaqi","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lian","family":"Li","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,27]]},"reference":[{"issue":"4","key":"8340_CR1","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1109\/MITS.2019.2953543","volume":"13","author":"FJ Belmonte","year":"2020","unstructured":"Belmonte FJ, Mart\u00edn S, Sancristobal E, Ruip\u00e9rez-Valiente JA, Castro M (2020) Overview of embedded systems to build reliable and safe adas and ad systems. IEEE Intell Transp Syst Mag 13(4):239\u2013250. https:\/\/doi.org\/10.1109\/MITS.2019.2953543","journal-title":"IEEE Intell Transp Syst Mag"},{"issue":"8","key":"8340_CR2","doi-asserted-by":"publisher","first-page":"1020","DOI":"10.1016\/j.micpro.2013.08.002","volume":"37","author":"C El Salloum","year":"2013","unstructured":"El Salloum C, Elshuber M, H\u00f6ftberger O, Isakovic H, Wasicek A (2013) The across mpsoc-a new generation of multi-core processors designed for safety-critical embedded systems. Microprocess Microsyst 37(8):1020\u20131032. https:\/\/doi.org\/10.1016\/j.micpro.2013.08.002","journal-title":"Microprocess Microsyst"},{"key":"8340_CR3","doi-asserted-by":"publisher","unstructured":"Tsog N, Mubeen S, Bruhn F, Behnam M, Sj\u00f6din M (2021) Offloading accelerator-intensive workloads in CPU-GPU heterogeneous processors. In: 2021 26th IEEE International Conference on Emerging Technologies and Factory Automation (ETFA), pp 1\u20138. https:\/\/doi.org\/10.1109\/ETFA45728.2021.9613666","DOI":"10.1109\/ETFA45728.2021.9613666"},{"issue":"11","key":"8340_CR4","doi-asserted-by":"publisher","first-page":"3874","DOI":"10.1109\/TCAD.2022.3197532","volume":"41","author":"S Chang","year":"2022","unstructured":"Chang S, Bi R, Sun J, Liu W, Yu Q, Deng Q, Gu Z (2022) Toward minimum wcrt bound for dag tasks under prioritized list scheduling algorithms. IEEE Trans Comput Aided Des Integr Circuits Syst 41(11):3874\u20133885. https:\/\/doi.org\/10.1109\/TCAD.2022.3197532","journal-title":"IEEE Trans Comput Aided Des Integr Circuits Syst"},{"key":"8340_CR5","doi-asserted-by":"publisher","unstructured":"Sun J, Guan N, Sun J, Chi Y (2019) Calculating response-time bounds for openmp task systems with conditional branches. In: 2019 IEEE Real-Time and Embedded Technology and Applications Symposium (RTAS), pp 169\u2013181. https:\/\/doi.org\/10.1109\/RTAS.2019.00022","DOI":"10.1109\/RTAS.2019.00022"},{"issue":"10","key":"8340_CR6","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 et al (2019) Intra-task priority assignment in real-time scheduling of dag tasks on multi-cores. IEEE Trans Parallel Distrib Syst 30(10):2283\u20132295. https:\/\/doi.org\/10.1109\/TPDS.2019.2910525","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"8340_CR7","doi-asserted-by":"publisher","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), pp 128\u2013140. https:\/\/doi.org\/10.1109\/RTSS49844.2020.00022","DOI":"10.1109\/RTSS49844.2020.00022"},{"issue":"7","key":"8340_CR8","doi-asserted-by":"publisher","first-page":"9353","DOI":"10.1007\/s11227-023-05788-x","volume":"80","author":"Y Zhu","year":"2024","unstructured":"Zhu Y, Chen J, Li L (2024) A critical path task scheduling algorithm based on sequential failure factor. J Supercomput 80(7):9353\u20139383. https:\/\/doi.org\/10.1007\/s11227-023-05788-x","journal-title":"J Supercomput"},{"key":"8340_CR9","doi-asserted-by":"publisher","unstructured":"Liu C, Anderson JH (2010) Supporting soft real-time dag-based systems on multiprocessors with no utilization loss. In: 2010 31st IEEE Real-Time Systems Symposium, pp 3\u201313. https:\/\/doi.org\/10.1109\/RTSS.2010.38","DOI":"10.1109\/RTSS.2010.38"},{"key":"8340_CR10","doi-asserted-by":"publisher","unstructured":"Baruah S, Bonifaci V, Marchetti-Spaccamela A, Stougie L, Wiese A (2012) A generalized parallel task model for recurrent real-time processes. In: 2012 IEEE 33rd Real-Time Systems Symposium, pp 63\u201372. https:\/\/doi.org\/10.1109\/RTSS.2012.59","DOI":"10.1109\/RTSS.2012.59"},{"key":"8340_CR11","doi-asserted-by":"publisher","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), pp 226\u2013238. https:\/\/doi.org\/10.1109\/RTAS48715.2020.000-4","DOI":"10.1109\/RTAS48715.2020.000-4"},{"key":"8340_CR12","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 Architect 105:101704. https:\/\/doi.org\/10.1016\/j.sysarc.2019.101704","journal-title":"J Syst Architect"},{"issue":"3","key":"8340_CR13","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1109\/TC.2020.2990282","volume":"70","author":"F Guan","year":"2020","unstructured":"Guan F, Qiao J, Han Y (2020) Dag-fluid: a real-time scheduling algorithm for dags. IEEE Trans Comput 70(3):471\u2013482. https:\/\/doi.org\/10.1109\/TC.2020.2990282","journal-title":"IEEE Trans Comput"},{"issue":"5s","key":"8340_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3358236","volume":"18","author":"P Chen","year":"2019","unstructured":"Chen P, Liu W, Jiang X, He Q, Guan N (2019) Timing-anomaly free dynamic scheduling of conditional dag tasks on multi-core systems. ACM Trans Embed Comput Syst (TECS) 18(5s):1\u201319. https:\/\/doi.org\/10.1145\/3358236","journal-title":"ACM Trans Embed Comput Syst (TECS)"},{"key":"8340_CR15","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1007\/s11390-019-1962-4","volume":"34","author":"H Lin","year":"2019","unstructured":"Lin H, Li M-F, Jia C-F, Liu J-N, An H (2019) Degree-of-node task scheduling of fine-grained parallel programs on heterogeneous systems. J Comput Sci Technol 34:1096\u20131108. https:\/\/doi.org\/10.1007\/s11390-019-1962-4","journal-title":"J Comput Sci Technol"},{"key":"8340_CR16","doi-asserted-by":"publisher","unstructured":"He Q, Lv M, Guan N (2021) Response time bounds for dag tasks with arbitrary intra-task priority assignment. In: 33rd Euromicro Conference on Real-Time Systems (ECRTS 2021), pp 8\u20131. https:\/\/doi.org\/10.4230\/LIPIcs.ECRTS.2021.8","DOI":"10.4230\/LIPIcs.ECRTS.2021.8"},{"issue":"12","key":"8340_CR17","doi-asserted-by":"publisher","first-page":"4019","DOI":"10.1109\/TPDS.2022.3177046","volume":"33","author":"S Zhao","year":"2022","unstructured":"Zhao S, Dai X, Bate I (2022) Dag scheduling and analysis on multi-core systems by modelling parallelism and dependency. IEEE Trans Parallel Distrib Syst 33(12):4019\u20134038. https:\/\/doi.org\/10.1109\/TPDS.2022.3177046","journal-title":"IEEE Trans Parallel Distrib Syst"},{"key":"8340_CR18","doi-asserted-by":"publisher","unstructured":"Li J, Chen JJ, Agrawal K, Lu C, Gill C, Saifullah A (2014) Analysis of federated and global scheduling for parallel real-time tasks. In: 2014 26th Euromicro Conference on Real-Time Systems, pp 85\u201396. https:\/\/doi.org\/10.1109\/ECRTS.2014.23","DOI":"10.1109\/ECRTS.2014.23"},{"key":"8340_CR19","doi-asserted-by":"publisher","unstructured":"Baruah S (2015) The federated scheduling of systems of conditional sporadic dag tasks. In: 2015 International Conference on Embedded Software (EMSOFT), pp 1\u201310. https:\/\/doi.org\/10.1109\/EMSOFT.2015.7318254","DOI":"10.1109\/EMSOFT.2015.7318254"},{"key":"8340_CR20","doi-asserted-by":"publisher","unstructured":"Ueter N, Von Der Br\u00fcggen G, Chen J-J, Li J, Agrawal K (2018) Reservation-based federated scheduling for parallel real-time tasks. In: 2018 IEEE Real-Time Systems Symposium (RTSS), pp 482\u2013494. https:\/\/doi.org\/10.1109\/RTSS.2018.00061","DOI":"10.1109\/RTSS.2018.00061"},{"key":"8340_CR21","doi-asserted-by":"publisher","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), pp 80\u201391. https:\/\/doi.org\/10.1109\/RTSS.2017.00015","DOI":"10.1109\/RTSS.2017.00015"},{"key":"8340_CR22","doi-asserted-by":"publisher","unstructured":"Yang T, Tang Y, Jiang X, Deng Q, Guan N (2019) Semi-federated scheduling of mixed-criticality system for sporadic dag tasks. In: 2019 IEEE 22nd International Symposium on Real-Time Distributed Computing (ISORC), pp 163\u2013170. https:\/\/doi.org\/10.1109\/ISORC.2019.00039","DOI":"10.1109\/ISORC.2019.00039"},{"key":"8340_CR23","doi-asserted-by":"publisher","unstructured":"Shariati M, Naghibzadeh M, Noori H (2018) Semi-federated scheduling of multiple periodic real-time dags of non-preemptable tasks. In: 2018 8th International Conference on Computer and Knowledge Engineering (ICCKE), pp 84\u201391. https:\/\/doi.org\/10.1109\/ICCKE.2018.8566678","DOI":"10.1109\/ICCKE.2018.8566678"},{"key":"8340_CR24","doi-asserted-by":"publisher","unstructured":"Fonseca J, Nelissen G, Nelis V, Pinho LM (2016) Response time analysis of sporadic dag tasks under partitioned scheduling. In: 2016 11th IEEE Symposium on Industrial Embedded Systems (SIES), pp 1\u201310. https:\/\/doi.org\/10.1109\/SIES.2016.7509443","DOI":"10.1109\/SIES.2016.7509443"},{"key":"8340_CR25","doi-asserted-by":"publisher","unstructured":"Casini D, Biondi A, Nelissen G, Buttazzo G (2018) Partitioned fixed-priority scheduling of parallel tasks without preemptions. In: 2018 IEEE Real-Time Systems Symposium (RTSS), pp 421\u2013433. https:\/\/doi.org\/10.1109\/RTSS.2018.00056","DOI":"10.1109\/RTSS.2018.00056"},{"key":"8340_CR26","doi-asserted-by":"publisher","unstructured":"Bado B, George L, Courbin P, Goossens J (2012) A semi-partitioned approach for parallel real-time scheduling. In: Proceedings of the 20th International Conference on Real-Time and Network Systems, pp 151\u2013160. https:\/\/doi.org\/10.1145\/2392987.2393006","DOI":"10.1145\/2392987.2393006"},{"key":"8340_CR27","doi-asserted-by":"publisher","unstructured":"Maia C, Yomsi PM, Nogueira L, Pinho LM (2015) Semi-partitioned scheduling of fork-join tasks using work-stealing. In: 2015 IEEE 13th International Conference on Embedded and Ubiquitous Computing, pp 25\u201334. https:\/\/doi.org\/10.1109\/EUC.2015.30","DOI":"10.1109\/EUC.2015.30"},{"issue":"1","key":"8340_CR28","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/s11241-020-09359-8","volume":"57","author":"C Hobbs","year":"2021","unstructured":"Hobbs C, Tong Z, Bakita J, Anderson JH (2021) Statically optimal dynamic soft real-time semi-partitioned scheduling. Real Time Syst 57(1):97\u2013140. https:\/\/doi.org\/10.1007\/s11241-020-09359-8","journal-title":"Real Time Syst"},{"key":"8340_CR29","doi-asserted-by":"publisher","DOI":"10.1109\/TSC.2024.3422828","author":"L Lin","year":"2024","unstructured":"Lin L, Pan L, Liu S (2024) Spotdag: an rl-based algorithm for dag workflow scheduling in heterogeneous cloud environments. IEEE Trans Serv Comput. https:\/\/doi.org\/10.1109\/TSC.2024.3422828","journal-title":"IEEE Trans Serv Comput"},{"issue":"4","key":"8340_CR30","doi-asserted-by":"publisher","first-page":"1034","DOI":"10.1109\/TC.2024.3350243","volume":"73","author":"B Sun","year":"2024","unstructured":"Sun B, Theile M, Qin Z, Bernardini D, Roy D, Bastoni A, Caccamo M (2024) Edge generation scheduling for dag tasks using deep reinforcement learning. IEEE Trans Comput 73(4):1034\u20131047. https:\/\/doi.org\/10.1109\/TC.2024.3350243","journal-title":"IEEE Trans Comput"},{"issue":"2","key":"8340_CR31","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1137\/0117039","volume":"17","author":"RL Graham","year":"1969","unstructured":"Graham RL (1969) Bounds on multiprocessing timing anomalies. SIAM J Appl Math 17(2):416\u2013429. https:\/\/doi.org\/10.1137\/0117039","journal-title":"SIAM J Appl Math"},{"key":"8340_CR32","doi-asserted-by":"publisher","unstructured":"Melani A, Bertogna M, Bonifaci V, Marchetti-Spaccamela A, Buttazzo GC (2015) Response-time analysis of conditional dag tasks in multiprocessor systems. In: 2015 27th Euromicro Conference on Real-Time Systems, pp 211\u2013221. https:\/\/doi.org\/10.1109\/ECRTS.2015.26","DOI":"10.1109\/ECRTS.2015.26"},{"key":"8340_CR33","doi-asserted-by":"publisher","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. https:\/\/doi.org\/10.1145\/3139258.3139288","DOI":"10.1145\/3139258.3139288"},{"key":"8340_CR34","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1007\/s11241-020-09346-z","volume":"56","author":"K Agrawal","year":"2020","unstructured":"Agrawal K, Baruah S, Ekberg P, Li J (2020) Optimal scheduling of measurement-based parallel real-time tasks. Real Time Syst 56:247\u2013253. https:\/\/doi.org\/10.1007\/s11241-020-09346-z","journal-title":"Real Time Syst"},{"key":"8340_CR35","doi-asserted-by":"publisher","unstructured":"Vargas R, Quinones E, Marongiu A (2015) Openmp and timing predictability: a possible union? In: 2015 Design, Automation & Test in Europe Conference & Exhibition (DATE), pp 617\u2013620. https:\/\/doi.org\/10.7873\/DATE.2015.0778","DOI":"10.7873\/DATE.2015.0778"},{"key":"8340_CR36","doi-asserted-by":"publisher","unstructured":"Serrano MA, Melani A, Vargas R, Marongiu A, Bertogna M, Quinones E (2015) Timing characterization of openmp4 tasking model. In: 2015 International Conference on Compilers, Architecture and Synthesis for Embedded Systems (CASES), pp 157\u2013166. https:\/\/doi.org\/10.1109\/CASES.2015.7324556","DOI":"10.1109\/CASES.2015.7324556"},{"key":"8340_CR37","doi-asserted-by":"publisher","unstructured":"Sun J, Guan N, Guo Z, Xue Y, He J, Tan G (2021) Calculating worst-case response time bounds for openmp programs with loop structures. In: 2021 IEEE Real-Time Systems Symposium (RTSS), pp 123\u2013135. https:\/\/doi.org\/10.1109\/RTSS52674.2021.00022","DOI":"10.1109\/RTSS52674.2021.00022"},{"key":"8340_CR38","doi-asserted-by":"publisher","unstructured":"Davis RI, Burns A (2009) Priority assignment for global fixed priority pre-emptive scheduling in multiprocessor real-time systems. In: 2009 30th IEEE Real-Time Systems Symposium, pp 398\u2013409. https:\/\/doi.org\/10.1109\/RTSS.2009.31","DOI":"10.1109\/RTSS.2009.31"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08340-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s11227-026-08340-9","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s11227-026-08340-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T16:26:34Z","timestamp":1772209594000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s11227-026-08340-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,2,27]]},"references-count":38,"journal-issue":{"issue":"4","published-online":{"date-parts":[[2026,3]]}},"alternative-id":["8340"],"URL":"https:\/\/doi.org\/10.1007\/s11227-026-08340-9","relation":{},"ISSN":["1573-0484"],"issn-type":[{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,2,27]]},"assertion":[{"value":"14 June 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"12 February 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 February 2026","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 no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}],"article-number":"209"}}