Document Open Access Logo

Revisiting Slot-Shifting’s Offline Acceptance Test for Sporadic Tasks: A Technical Note

Authors Mohammad Ibrahim Alkoudsi , Damir Isovic , Gerhard Fohler

PDF

File

Thumbnail PDF
PDF
LITES.10.1.4.pdf
  • Filesize: 0.58 MB
  • 6 pages

Document Identifiers

Subject Classification

ACM Subject Classification
  • Computer systems organization → Real-time systems
  • Software and its engineering → Real-time schedulability
Keywords
  • real-time systems scheduling
  • time-triggered systems
  • offline acceptance test of sporadic tasks

Metrics

Abstract

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.

Cite As Get BibTex

Mohammad Ibrahim Alkoudsi, Damir Isovic, and Gerhard Fohler. Revisiting Slot-Shifting’s Offline Acceptance Test for Sporadic Tasks: A Technical Note. In LITES, Volume 10, Issue 1 (2025). Leibniz Transactions on Embedded Systems, Volume 10, Issue 1, pp. 4:1-4:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2025) https://doi.org/10.4230/LITES.10.1.4

Author Details

Mohammad Ibrahim Alkoudsi
  • RPTU Kaiserslautern-Landau, Kaiserslautern, Germany
Damir Isovic
  • Mälardalen University, Västerås, Sweden
Gerhard Fohler
  • RPTU Kaiserslautern-Landau, Kaiserslautern, Germany

Funding

The work presented in this paper was supported in part by the Fonds National de la Recherche Luxembourg (FNR) and the Deutsche Forschungs Gemeinschaft (DFG) through the Core-Inter project ReSAC.

Acknowledgements

The authors gratefully acknowledge Anaïs Finzi, Silviu S. Craciunas, and Marc Boyer, whose evaluation presented in [Finzi et al., 2024] inspired our review of the original work, and thank them for comments and valuable discussions. We also would like to thank the reviewers for their constructive comments that contributed to the quality of the text.

References

  1. Mohammad Ibrahim Alkoudsi, Sanjoy Baruah, Pontus Ekberg, Gerhard Fohler, Joël Goossens, and Maryam Moslehi. Extending periodic task sets with sporadic tasks: Computational complexity and exact feasibility tests. In Proceedings of the 33rd International Conference on Real-Time Networks and Systems (RTNS '25), Pisa, Italy, 2025. Google Scholar
  2. Sanjoy K. Baruah, Louis E. Rosier, and Rodney R. Howell. Algorithms and complexity concerning the preemptive scheduling of periodic, real-time tasks on one processor. Real-Time Systems, 2, 1990. URL: https://doi.org/10.1007/BF01995675.
  3. Anaïs Finzi, Silviu S. Craciunas, and Marc Boyer. Integrating sporadic events in time-triggered systems via affine envelope approximations. In 2024 IEEE 30th Real-Time and Embedded Technology and Applications Symposium (RTAS), pages 15-28, 2024. URL: https://doi.org/10.1109/RTAS61025.2024.00010.
  4. G. Fohler. Joint scheduling of distributed complex periodic and hard aperiodic tasks in statically scheduled systems. In Proceedings 16th IEEE Real-Time Systems Symposium, pages 152-161, 1995. URL: https://doi.org/10.1109/REAL.1995.495205.
  5. Damir Isovic and Gerhard Fohler. Handling mixed sets of tasks in combined offline and online scheduled real-time systems. Real-Time Syst., 43(3):296-325, November 2009. URL: https://doi.org/10.1007/s11241-009-9088-3.
  6. Joseph Y.-T. Leung and M.L. Merrill. A note on preemptive scheduling of periodic, real-time tasks. Information Processing Letters, 11(3):115-118, 1980. URL: https://doi.org/10.1016/0020-0190(80)90123-4.
Any Issues?
X

Feedback on the Current Page

CAPTCHA

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail
© 2023-2025 Schloss Dagstuhl – LZI GmbH About DROPS Imprint Privacy Contact