Abstract
In this paper, we revisit global as well as local schedulability analysis of synchronization protocols based on the stack resource protocol (SRP) and overrun without payback
for hierarchical scheduling frameworks based on fixed-priority pre-emptive scheduling (FPPS). We show that both the existing global and local schedulability analysis are pessimistic, present improved analysis, and illustrate the improvements by means
of examples.
| Original language | English |
|---|---|
| Title of host publication | Proceedings 2nd Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS 2009, Washington DC, USA, December 1, 2009) |
| Pages | 1-9 |
| Publication status | Published - 2009 |