{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,9]],"date-time":"2026-07-09T15:18:18Z","timestamp":1783610298700,"version":"3.55.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"5s","license":[{"start":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T00:00:00Z","timestamp":1506470400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"European Union's Horizon 2020 research and innovation programme","award":["644080"],"award-info":[{"award-number":["644080"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2017,10,31]]},"abstract":"<jats:p>The hard deadline model is very popular in real-time research, but is representative or applicable to a small number of systems. Many applications, including control systems, are capable of tolerating occasional deadline misses, but are seriously compromised by a repeating pattern of late terminations. The weakly hard real-time model tries to capture these requirements by analyzing the conditions that guarantee that a maximum number of deadlines can be possibly missed in any set of consecutive activations. We provide a new weakly hard schedulability analysis method that applies to constrained-deadline periodic real-time systems scheduled with fixed priority and without knowledge of the task activation offsets. The analysis is based on a Mixed Integer Linear Programming (MILP) problem formulation; it is very general and can be adapted to include the consideration of resource sharing and activation jitter. A set of experiments conducted on an automotive engine control application and randomly generated tasksets show the applicability and accuracy of the proposed technique.<\/jats:p>","DOI":"10.1145\/3126497","type":"journal-article","created":{"date-parts":[[2017,9,27]],"date-time":"2017-09-27T12:33:53Z","timestamp":1506515633000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":43,"title":["Weakly Hard Schedulability Analysis for Fixed Priority Scheduling of Periodic Real-Time Tasks"],"prefix":"10.1145","volume":"16","author":[{"given":"Youcheng","family":"Sun","sequence":"first","affiliation":[{"name":"University of Oxford, UK"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marco Di","family":"Natale","sequence":"additional","affiliation":[{"name":"Scuola Superiore Sant\u2019Anna, Pisa, Italy"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,9,27]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"21st IEEE Real-Time and Embedded Technology and Applications Symposium. 172--181","author":"Zaid","year":"2015","unstructured":"Zaid Al-bayati, Youcheng Sun , Haibo Zeng , Marco Di Natale , Qi Zhu , and Brett Meyer . 2015 . Task placement and selection of data consistency mechanisms for real-time multicore applications . In 21st IEEE Real-Time and Embedded Technology and Applications Symposium. 172--181 . Zaid Al-bayati, Youcheng Sun, Haibo Zeng, Marco Di Natale, Qi Zhu, and Brett Meyer. 2015. Task placement and selection of data consistency mechanisms for real-time multicore applications. In 21st IEEE Real-Time and Embedded Technology and Applications Symposium. 172--181."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485554"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2012.79"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2001.914701"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2006.47"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.919277"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-006-9010-1"},{"key":"e_1_2_1_8_1","volume-title":"Youcheng Sun, and Stefania Botta.","author":"Biondi Alessandro","year":"2016","unstructured":"Alessandro Biondi , Marco Di Natale , Youcheng Sun, and Stefania Botta. 2016 . Moving from Single-core to Multicore : Initial Findings on a Fuel Injection Case Study. Technical Report. SAE Technical Paper . Alessandro Biondi, Marco Di Natale, Youcheng Sun, and Stefania Botta. 2016. Moving from Single-core to Multicore: Initial Findings on a Fuel Injection Case Study. Technical Report. SAE Technical Paper."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2516821.2516825"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2593458.2593467"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2834848.2834860"},{"key":"e_1_2_1_12_1","volume-title":"Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications","author":"Buttazzo Giorgio","unstructured":"Giorgio Buttazzo . 2011. Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications . Vol. 24 . Springer Science 8 Business Media. Giorgio Buttazzo. 2011. Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications. Vol. 24. Springer Science 8 Business Media."},{"key":"e_1_2_1_13_1","volume-title":"Proceedings. IEEE, 222--231","author":"Davis Robert I.","year":"1993","unstructured":"Robert I. Davis , Ken W. Tindell , and Alan Burns . 1993 . Scheduling slack time in fixed priority pre-emptive systems. In Real-Time Systems Symposium . Proceedings. IEEE, 222--231 . Robert I. Davis, Ken W. Tindell, and Alan Burns. 1993. Scheduling slack time in fixed priority pre-emptive systems. In Real-Time Systems Symposium. Proceedings. IEEE, 222--231."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/827272.829145"},{"key":"e_1_2_1_15_1","volume-title":"Proceedings 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS). 6--11","author":"Emberson Paul","unstructured":"Paul Emberson , Roger Stafford , and Robert I. Davis . 2010. Techniques for the synthesis of multiprocessor tasksets . In Proceedings 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS). 6--11 . Paul Emberson, Roger Stafford, and Robert I. Davis. 2010. Techniques for the synthesis of multiprocessor tasksets. In Proceedings 1st International Workshop on Analysis Tools and Methodologies for Embedded and Real-time Systems (WATERS). 6--11."},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2014.28"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.5555\/1950815.1950869"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656045.2656059"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTAS.2015.7108445"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2012.67"},{"key":"e_1_2_1_21_1","first-page":"201","article-title":"Fixed priority scheduling of periodic task sets with arbitrary deadlines","volume":"90","author":"Lehoczky John P.","year":"1990","unstructured":"John P. Lehoczky . 1990 . Fixed priority scheduling of periodic task sets with arbitrary deadlines . In RTSS , Vol. 90. 201 -- 209 . John P. Lehoczky. 1990. Fixed priority scheduling of periodic task sets with arbitrary deadlines. In RTSS, Vol. 90. 201--209.","journal-title":"RTSS"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.477249"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2492708.2492836"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.774906"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/787256.787351"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:TIME.0000045315.61234.1e"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.57058"},{"key":"e_1_2_1_30_1","volume-title":"Co-design of arbitrated network control systems with overrun strategies","author":"Soudbakhsh Damoon","year":"2016","unstructured":"Damoon Soudbakhsh , Linh T. X. Phan , Anuradha M. Annaswamy , and Oleg Sokolsky . 2016. Co-design of arbitrated network control systems with overrun strategies . IEEE Transactions on Control of Network Systems ( 2016 ). Damoon Soudbakhsh, Linh T. X. Phan, Anuradha M. Annaswamy, and Oleg Sokolsky. 2016. Co-design of arbitrated network control systems with overrun strategies. IEEE Transactions on Control of Network Systems (2016)."},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2502524.2502542"},{"key":"e_1_2_1_32_1","volume-title":"Industrial Embedded Systems (SIES), 2013 8th IEEE International Symposium on. 49--58","author":"Wieder Alexander","unstructured":"Alexander Wieder and Bj\u00f6rn B. Brandenburg . 2013. Efficient partitioning of sporadic real-time tasks with shared resources and spin locks . In Industrial Embedded Systems (SIES), 2013 8th IEEE International Symposium on. 49--58 . Alexander Wieder and Bj\u00f6rn B. Brandenburg. 2013. Efficient partitioning of sporadic real-time tasks with shared resources and spin locks. In Industrial Embedded Systems (SIES), 2013 8th IEEE International Symposium on. 49--58."},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2015.29"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.3182\/20140824-6-ZA-1003.00289"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2015.23"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126497","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3126497","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:05:01Z","timestamp":1750273501000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3126497"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,9,27]]},"references-count":35,"journal-issue":{"issue":"5s","published-print":{"date-parts":[[2017,10,31]]}},"alternative-id":["10.1145\/3126497"],"URL":"https:\/\/doi.org\/10.1145\/3126497","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"value":"1539-9087","type":"print"},{"value":"1558-3465","type":"electronic"}],"subject":[],"published":{"date-parts":[[2017,9,27]]},"assertion":[{"value":"2017-04-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-06-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-27","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}