2026-09-22T21:02:43Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:25235 2026-09-05T19:09:33Z ddc:004 open_access

Revisiting Slot-Shifting’s Offline Acceptance Test for Sporadic Tasks: A Technical Note Alkoudsi, Mohammad Ibrahim Isovic, Damir Fohler, Gerhard real-time systems scheduling time-triggered systems offline acceptance test of sporadic tasks The Slot-Shifting algorithm presents a solution to combine the benefits of offline and online scheduling in time-triggered systems. It dynamically adjusts the allocation of time slots to tasks in the scheduling tables to accommodate aperiodic tasks at runtime. In this note, we revisit an extension to Slot-Shifting that enables it to handle sporadic task sets. In particular, we clarify the assumptions required for the correct application of its offline acceptance test, identify sources of pessimism within it, and address its schedulability analysis interval. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Mohammad Ibrahim Alkoudsi and Damir Isovic and Gerhard Fohler 2025 Is Part Of LITES, Volume 10, Issue 1 (2025). Leibniz Transactions on Embedded Systems, Volume 10, Issue 1 Article Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LITES.10.1.4 urn:nbn:de:0030-drops-252354 https://drops.dagstuhl.de/entities/document/10.4230/LITES.10.1.4 eng https://creativecommons.org/licenses/by/4.0/legalcode