{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:04:59Z","timestamp":1757311499542,"version":"3.41.0"},"reference-count":41,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T00:00:00Z","timestamp":1607299200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2021,1,31]]},"abstract":"<jats:p>\n            The weakly hard real-time model is an abstraction for applications, including control systems, that can tolerate occasional deadline misses, but can also be compromised if a sufficiently high number of late terminations occur in a given time window. The weakly hard model allows us to constrain the maximum number of acceptable missed deadlines in any set of consecutive task executions. A big challenge for weakly hard systems is to provide a\n            <jats:italic>schedulability analysis<\/jats:italic>\n            that applies to a general task model, while avoiding excessive pessimism. In this work, we develop a general weakly hard analysis based on a Mixed Integer Linear Programming (MILP) formulation. The analysis applies to constrained-deadline periodic real-time systems scheduled with fixed priority and no knowledge of the task activation offsets, while allowing for activation jitter. Our analysis considers two common policies for handling missed deadlines, i.e., (i) letting the job continue until completion or (ii) killing its execution immediately. For this policy, ours is the first and only m-k analysis currently available. Experiments conducted on randomly generated task sets show the applicability and accuracy of the proposed technique as well as the improvements with respect to competing techniques.\n          <\/jats:p>","DOI":"10.1145\/3404888","type":"journal-article","created":{"date-parts":[[2020,12,7]],"date-time":"2020-12-07T18:26:48Z","timestamp":1607365608000},"page":"1-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Generalized Weakly Hard Schedulability Analysis for Real-Time Periodic Tasks"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0377-3327","authenticated-orcid":false,"given":"Paolo","family":"Pazzaglia","sequence":"first","affiliation":[{"name":"Scuola Superiore Sant\u2019Anna, Pisa, Italy"}]},{"given":"Youcheng","family":"Sun","sequence":"additional","affiliation":[{"name":"Queen\u2019s University Belfast, UK"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4480-8808","authenticated-orcid":false,"given":"Marco Di","family":"Natale","sequence":"additional","affiliation":[{"name":"Scuola Superiore Sant\u2019Anna, Pisa, Italy"}]}],"member":"320","published-online":{"date-parts":[[2020,12,7]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"30th Euromicro Conference on Real-Time Systems (ECRTS).","author":"Ahrendts Leonie","year":"2018","unstructured":"Leonie Ahrendts , Sophie Quinton , Thomas Boroske , and Rolf Ernst . 2018 . Verifying weakly-hard real-time properties of traffic streams in switched networks . In 30th Euromicro Conference on Real-Time Systems (ECRTS). Leonie Ahrendts, Sophie Quinton, Thomas Boroske, and Rolf Ernst. 2018. Verifying weakly-hard real-time properties of traffic streams in switched networks. In 30th Euromicro Conference on Real-Time Systems (ECRTS)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139258.3139259"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/2485288.2485554"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2012.79"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2001.914701"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2006.47"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.919277"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11241-005-0507-9"},{"volume-title":"Proceedings of the 21st International Conference on Real-Time Networks and Systems. ACM, 193--202","author":"Bril Reinder J.","key":"e_1_2_1_9_1","unstructured":"Reinder J. Bril , Johan J. Lukkien , and Rudolf H. Mak . 2013. Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines . In Proceedings of the 21st International Conference on Real-Time Networks and Systems. ACM, 193--202 . Reinder J. Bril, Johan J. Lukkien, and Rudolf H. Mak. 2013. Best-case response times and jitter analysis of real-time tasks with arbitrary deadlines. In Proceedings of the 21st International Conference on Real-Time Networks and Systems. ACM, 193--202."},{"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"},{"volume-title":"Hard Real-time Computing Systems: Predictable Scheduling Algorithms and Applications","author":"Buttazzo Giorgio","key":"e_1_2_1_12_1","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","doi-asserted-by":"publisher","DOI":"10.3182\/20050703-6-CZ-1902.01076"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2014.28"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/TIE.2015.2504339"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.5555\/1950815.1950869"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2656045.2656059"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3302504.3311811"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/29.5.390"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTSS.2012.67"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.1989.63567"},{"key":"e_1_2_1_22_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_23_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-5316(82)90024-4"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/321738.321743"},{"key":"e_1_2_1_25_1","doi-asserted-by":"crossref","unstructured":"M. M. Hamdaoui and P. Ramanathan. 1995. A dynamic priority assignment technique for streams with (m k)-firm deadlines. In IEEE Transactions on Computers.  M. M. Hamdaoui and P. Ramanathan. 1995. A dynamic priority assignment technique for streams with (m k)-firm deadlines. In IEEE Transactions on Computers.","DOI":"10.1109\/12.477249"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/REAL.2000.896003"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8715017"},{"key":"e_1_2_1_28_1","volume-title":"Proceedings of the 31th Euromicro Conference on Real-Time Systems (ECRTS","author":"Pazzaglia Paolo","year":"2019","unstructured":"Paolo Pazzaglia , Claudio Mandrioli , Martina Maggio , and Anton Cervin . 2019 . DMAC: Deadline-miss aware control . In Proceedings of the 31th Euromicro Conference on Real-Time Systems (ECRTS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Paolo Pazzaglia, Claudio Mandrioli, Martina Maggio, and Anton Cervin. 2019. DMAC: Deadline-miss aware control. In Proceedings of the 31th Euromicro Conference on Real-Time Systems (ECRTS 2019). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_29_1","volume-title":"Proceedings of the 30th Euromicro Conference on Real-Time Systems (ECRTS","author":"Pazzaglia Paolo","year":"2018","unstructured":"Paolo Pazzaglia , Luigi Pannocchi , Alessandro Biondi , and Marco Di Natale . 2018 . Beyond the weakly hard model: Measuring the performance cost of deadline misses . In Proceedings of the 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik. Paolo Pazzaglia, Luigi Pannocchi, Alessandro Biondi, and Marco Di Natale. 2018. Beyond the weakly hard model: Measuring the performance cost of deadline misses. In Proceedings of the 30th Euromicro Conference on Real-Time Systems (ECRTS 2018). Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2492708.2492836"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.774906"},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/EMRTS.2002.1019196"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:TIME.0000045315.61234.1e"},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3139258.3139282"},{"key":"e_1_2_1_35_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_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2502524.2502542"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3126497"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ECRTS.2015.29"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.3182\/20140824-6-ZA-1003.00289"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2015.23"},{"key":"e_1_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.21"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404888","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3404888","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:17:45Z","timestamp":1750191465000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3404888"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,12,7]]},"references-count":41,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2021,1,31]]}},"alternative-id":["10.1145\/3404888"],"URL":"https:\/\/doi.org\/10.1145\/3404888","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2020,12,7]]},"assertion":[{"value":"2019-08-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2020-12-07","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}