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  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.
|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|
|Publication status||Published - 2009|