par Alkoudsi, Ibrahim;Baruah, Sanjoy;Ekberg, Pontus;Fohler, Gerhard;Goossens, Joël
;Moslehi, Maryam
Référence Proceedings of Real-Time and Network Systems
Publication A Paraître, 2025-11-05
;Moslehi, MaryamRéférence Proceedings of Real-Time and Network Systems
Publication A Paraître, 2025-11-05
Article révisé par les pairs
| Résumé : | Given a periodic task system that is guaranteed to be schedu-lable upon a preemptive uniprocessor, this paper addresses the problemof determining whether schedulability is preserved upon the addition of aset of sporadic tasks. The precise computational complexity of the prob-lem is established, and exact tests are designed, formally proven correct,and evaluated experimentally to assess their practicality for runtime de-ployment. |



