Tighter schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks

M. Behnam, T. Nolte, R.J. Bril

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademicpeer-review

4 Citations (Scopus)
73 Downloads (Pure)

Abstract

In this paper, we show that both 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) are pessimistic. We present tighter global and local schedulability analysis, illustrate the improvements of the new analysis by means of examples, and show that the improved global analysis is both uniform and sustainable. We evaluate the new global and local schedulability analysis based on an extensive simulation study and compare the results with the existing analysis.
Original languageEnglish
Title of host publicationProceedings 16th IEEE International Conference on Engineering of Complex Computer Systems (ICECCS 2011, Las Vegas NV, USA, April 27-29, 2011)
PublisherIEEE Computer Society
Pages35-44
ISBN (Print)978-076954381-9
DOIs
Publication statusPublished - 2011

Fingerprint

Dive into the research topics of 'Tighter schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks'. Together they form a unique fingerprint.

Cite this