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

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

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

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

Mathematics and Computer Science

Research output: Book/Report › Report › Academic

36 Downloads (Pure)

Abstract

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.

Original language	English
Place of Publication	Eindhoven
Publisher	Technische Universiteit Eindhoven
Publication status	Published - 2010

Publication series

Name	Computer science reports
Volume	1005
ISSN (Print)	0926-4515

Access to Document

685859Final published version, 157 KB

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

@book{0e13908a920241ec890cc74671f5def5,

title = "Schedulability analysis of synchronization protocols based on overrun without payback for hierarchical scheduling frameworks revisited",

abstract = "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.",

author = "R.J. Bril and U. Keskin and M. Behnam and T. Nolte",

year = "2010",

language = "English",

series = "Computer science reports",

publisher = "Technische Universiteit Eindhoven",

}

TY - BOOK

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

AU - Bril, R.J.

AU - Keskin, U.

AU - Behnam, M.

AU - Nolte, T.

PY - 2010

Y1 - 2010

N2 - 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.

AB - 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.

M3 - Report

T3 - Computer science reports

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

PB - Technische Universiteit Eindhoven

CY - Eindhoven

ER -