In this paper, we revisit global as well as local schedulability analysis of synchronization protocols based on the stack resource policy (SRP) and overrun without payback for hierarchical scheduling frameworks based on fixed-priority preemptive 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.
|Place of Publication||Eindhoven|
|Publisher||Technische Universiteit Eindhoven|
|Publication status||Published - 2010|
|Name||Computer science reports|