{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T15:17:00Z","timestamp":1759936620278,"version":"build-2065373602"},"reference-count":34,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","funder":[{"name":"European Union\u2019s Horizon 2020 research and innovation programme","award":["865170"],"award-info":[{"award-number":["865170"]}]},{"name":"German Federal Ministry of Research, Technology and Space","award":["16KISK038"],"award-info":[{"award-number":["16KISK038"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2025,9,30]]},"abstract":"\n We introduce and study\n transfer schedulability<\/jats:italic>\n , a novel concept that describes how properties of a reference schedule derived from a scheduling algorithm\u00a0\n \n \\(\\mathcal {A}\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n are\n transferred<\/jats:italic>\n onto another scheduling algorithm\u00a0\n \n \\(\\mathcal {B}\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n for a given task system and fixed arrival times. Specifically, we say\n schedulability is transferred<\/jats:italic>\n from\n \n \\(\\mathcal {A}\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n to\n \n \\(\\mathcal {B}\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n if the task set is schedulable under\n \n \\(\\mathcal {B}\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n whenever all deadlines are met in the reference schedule produced by\n \n \\(\\mathcal {A}\\)<\/jats:tex-math>\n <\/jats:inline-formula>\n .\n <\/jats:p>\n \n We identify a sufficient criterion for schedulability to be transferred on uniprocessor systems, which we verify with the\n Rocq<\/jats:italic>\n proof assistant, and based on this criterion develop runtime mechanisms that enforce transfer schedulability. We relate transfer schedulability to prior approaches from the literature and demonstrate how the concept can be utilized to avoid timing anomalies and lower runtime scheduling overheads. We demonstrate that transfer schedulability can be utilized to prevent timing anomalies for non-preemptive scheduling, self-suspending tasks, and directed acyclic graph (DAG) tasks where the edges induce delays. Our evaluation on synthesized task sets shows improved schedulability compared to standard scheduling algorithms. We also evaluated the number of interventions necessary to transfer schedulability, and additionally demonstrate that the proposed runtime mechanisms eliminate timing anomalies (like a completely static, fully table-driven approach) while achieving a response-time distribution closely resembling those of classic dynamic, event-driven schedulers like EDF.\n <\/jats:p>\n ","DOI":"10.1145\/3763236","type":"journal-article","created":{"date-parts":[[2025,9,6]],"date-time":"2025-09-06T06:28:32Z","timestamp":1757140112000},"page":"1-25","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Transfer Schedulability in Periodic Real-Time Systems"],"prefix":"10.1145","volume":"24","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0382-7743","authenticated-orcid":false,"given":"Lars","family":"Willemsen","sequence":"first","affiliation":[{"name":"Faculty of Informatik, Technische Universit\u00e4t Dortmund","place":["Dortmund, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7575-7014","authenticated-orcid":false,"given":"Mario","family":"G\u00fcnzel","sequence":"additional","affiliation":[{"name":"Faculty of Informatik, Technische Universit\u00e4t Dortmund","place":["Dortmund, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8254-3815","authenticated-orcid":false,"given":"Bj\u00f6rn","family":"Brandenburg","sequence":"additional","affiliation":[{"name":"Real-Time Systems Group, Max Planck Institute for Software Systems","place":["Kaiserslautern, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8137-3612","authenticated-orcid":false,"given":"Georg von der","family":"Br\u00fcggen","sequence":"additional","affiliation":[{"name":"Faculty of Informatik, Technische Universit\u00e4t Dortmund","place":["Dortmund, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9518-2809","authenticated-orcid":false,"given":"Ching-Chi","family":"Lin","sequence":"additional","affiliation":[{"name":"Faculty of Informatik, Technische Universit\u00e4t Dortmund","place":["Dortmund, Germany"]}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8114-9760","authenticated-orcid":false,"given":"Jian-Jia","family":"Chen","sequence":"additional","affiliation":[{"name":"Faculty of Informatik, Technische Universit\u00e4t Dortmund","place":["Dortmund, Germany"]}]}],"member":"320","published-online":{"date-parts":[[2025,9,26]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_3_2_2","DOI":"10.1109\/RTSS49844.2020.00012"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_2","DOI":"10.1109\/RTAS52030.2021.00013"},{"doi-asserted-by":"publisher","key":"e_1_3_3_4_2","DOI":"10.1109\/RTSS.2006.47"},{"doi-asserted-by":"publisher","key":"e_1_3_3_5_2","DOI":"10.1109\/RTCSA.2005.48"},{"doi-asserted-by":"publisher","key":"e_1_3_3_6_2","DOI":"10.1109\/RTSS59052.2023.00012"},{"doi-asserted-by":"publisher","key":"e_1_3_3_7_2","DOI":"10.4230\/LIPICS.ECRTS.2018.26"},{"doi-asserted-by":"publisher","key":"e_1_3_3_8_2","DOI":"10.1109\/ECRTS.2016.28"},{"doi-asserted-by":"publisher","key":"e_1_3_3_9_2","DOI":"10.4230\/LIPIcs.ECRTS.2019.16"},{"doi-asserted-by":"publisher","key":"e_1_3_3_10_2","DOI":"10.1109\/RTSS.2014.31"},{"doi-asserted-by":"publisher","unstructured":"Jian-Jia Chen Geoffrey Nelissen Wen-Hung Huang Maolin Yang Bj\u00f6rn B. Brandenburg Konstantinos Bletsas Cong Liu Pascal Richard Fr\u00e9d\u00e9ric Ridouard Neil C. Audsley Raj Rajkumar Dionisio de Niz and Georg von der Br\u00fcggen. 2019. Many suspensions many problems: A review of self-suspending tasks in real-time systems. Real Time Syst. 55 1 (2019) 144\u2013207. DOI:10.1007\/S11241-018-9316-9","key":"e_1_3_3_11_2","DOI":"10.1007\/S11241-018-9316-9"},{"key":"e_1_3_3_12_2","volume-title":"Euromicro Conference on Real-Time Systems, ECRTS","author":"Chen Jian-Jia","year":"2017","unstructured":"Jian-Jia Chen, Georg von der Br\u00fcggen, Wen-Hung Huang, and Robert I. Davis. 2017. On the pitfalls of resource augmentation factors and utilization bounds in real-time scheduling. In Euromicro Conference on Real-Time Systems, ECRTS."},{"unstructured":"Coq. The Rocq proof assistant project web site. Retrieved Sep. 19 2025 from https:\/\/rocq-prover.org","key":"e_1_3_3_13_2"},{"doi-asserted-by":"publisher","key":"e_1_3_3_14_2","DOI":"10.1109\/REAL.2001.990615"},{"doi-asserted-by":"publisher","key":"e_1_3_3_15_2","DOI":"10.1109\/REAL.1995.495205"},{"doi-asserted-by":"publisher","key":"e_1_3_3_16_2","DOI":"10.1109\/RTSS49844.2020.00018"},{"key":"e_1_3_3_17_2","volume-title":"Property-based Timing Analysis of Distributed Real-time Systems","author":"G\u00fcnzel Mario","year":"2024","unstructured":"Mario G\u00fcnzel. 2024. Property-based Timing Analysis of Distributed Real-time Systems. Ph. D. Dissertation. Technical University of Dortmund, Germany."},{"key":"e_1_3_3_18_2","volume-title":"Euromicro Conference on Real-Time Systems, ECRTS","author":"Hamann Arne","year":"2017","unstructured":"Arne Hamann, Dakshina Dasari, Simon Kramer, Michael Pressler, and Falk Wurst. 2017. Communication centric design in complex automotive embedded systems. In Euromicro Conference on Real-Time Systems, ECRTS."},{"doi-asserted-by":"publisher","key":"e_1_3_3_19_2","DOI":"10.3850\/9783981537079_0244"},{"doi-asserted-by":"publisher","key":"e_1_3_3_20_2","DOI":"10.1093\/comjnl\/29.5.390"},{"key":"e_1_3_3_21_2","volume-title":"International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS)","author":"Kramer Simon","year":"2015","unstructured":"Simon Kramer, Dirk Ziegenbein, and Arne Hamann. 2015. Real world automotive benchmarks for free. In International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS)."},{"doi-asserted-by":"publisher","key":"e_1_3_3_22_2","DOI":"10.1109\/REAL.1989.63567"},{"doi-asserted-by":"publisher","key":"e_1_3_3_23_2","DOI":"10.1109\/RTAS58335.2023.00020"},{"doi-asserted-by":"publisher","key":"e_1_3_3_24_2","DOI":"10.1145\/321738.321743"},{"doi-asserted-by":"publisher","key":"e_1_3_3_25_2","DOI":"10.5555\/888951"},{"doi-asserted-by":"publisher","key":"e_1_3_3_26_2","DOI":"10.1109\/RTSS.2017.00009"},{"doi-asserted-by":"publisher","key":"e_1_3_3_27_2","DOI":"10.1109\/RTAS.2018.00035"},{"doi-asserted-by":"publisher","key":"e_1_3_3_28_2","DOI":"10.1109\/ECRTS.2015.15"},{"doi-asserted-by":"publisher","key":"e_1_3_3_29_2","DOI":"10.1109\/RTCSA.2016.15"},{"unstructured":"PROSA. PROSA \u2014 A Foundation for Formally Proven Schedulability Analysis. Retrieved Sep. 19 2025 from http:\/\/prosa.mpi-sws.org","key":"e_1_3_3_30_2"},{"doi-asserted-by":"publisher","key":"e_1_3_3_31_2","DOI":"10.1007\/BF02341920"},{"doi-asserted-by":"publisher","key":"e_1_3_3_32_2","DOI":"10.1109\/12.368008"},{"doi-asserted-by":"publisher","key":"e_1_3_3_33_2","DOI":"10.1109\/SIES.2016.7509419"},{"doi-asserted-by":"publisher","key":"e_1_3_3_34_2","DOI":"10.1145\/2997465.2997497"},{"doi-asserted-by":"publisher","unstructured":"Lars Willemsen Mario G\u00fcnzel Bj\u00f6rn Brandenburg Georg von der Br\u00fcggen Ching-Chi Lin and Jian-Jia Chen. 2025. Artifacts for transfer schedulability in periodic real-time systems. Zenodo. DOI:10.5281\/zenodo.15971824","key":"e_1_3_3_35_2","DOI":"10.5281\/zenodo.15971824"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3763236","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,8]],"date-time":"2025-10-08T14:28:38Z","timestamp":1759933718000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3763236"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,26]]},"references-count":34,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2025,9,30]]}},"alternative-id":["10.1145\/3763236"],"URL":"https:\/\/doi.org\/10.1145\/3763236","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2025,9,26]]},"assertion":[{"value":"2025-08-11","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-08-12","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-09-26","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}