Abstract
We present our ongoing work on synchronization in hierarchical scheduled real-time systems, where tasks are scheduled using fixed-priority pre-emptive scheduling. In this paper, we show that the original local schedulability analysis of the synchronization protocol SIRAP [4] is very pessimistic when tasks of a subsystem access many global shared resources. The analysis therefore suggests that a subsystem requires more CPU resources than necessary. A new way to perform the schedulability analysis is presented which can make the SIRAP protocol more efficient in terms of calculated CPU resource needs.
| Original language | English |
|---|---|
| Title of host publication | Proceedings 14th IEEE Conference on Emerging Technologies & Factory Automation (ETFA 2009, Palma de Mallorca, Spain, September 22-25, 2009) |
| Publisher | Institute of Electrical and Electronics Engineers |
| Pages | 1-4 |
| ISBN (Print) | 978-1-4244-2727-7 |
| DOIs | |
| Publication status | Published - 2009 |
Fingerprint Dive into the research topics of 'Improved SIRAP analysis for synchronization in hierarchical scheduled real-time systems'. Together they form a unique fingerprint.
Cite this
Behnam, M., Bril, R. J., & Nolte, T. (2009). Improved SIRAP analysis for synchronization in hierarchical scheduled real-time systems. In Proceedings 14th IEEE Conference on Emerging Technologies & Factory Automation (ETFA 2009, Palma de Mallorca, Spain, September 22-25, 2009) (pp. 1-4). Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ETFA.2009.5347234