Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited

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

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

30 Downloads (Pure)

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 languageEnglish
Title of host publicationProceedings 2nd Workshop on Compositional Theory and Technology for Real-Time Embedded Systems (CRTS 2009, Washington DC, USA, December 1, 2009)
Pages1-9
Publication statusPublished - 2009

Fingerprint

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

Cite this