Robust priority assignment for fixed priority real-time systems

R. I. Davis; A. Burns

doi:10.1109/RTSS.2007.43

Robust priority assignment for fixed priority real-time systems

R. I. Davis, A. Burns

Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Abstract

This paper focuses on priority assignment for real-time systems using fixed priority scheduling. It introduces and defines the concept of a "robust" priority ordering: the most appropriate priority ordering to use in a system subject to variable amounts of additional interference from sources such as interrupts, operating system overheads, exception handling, cycle stealing, and task execution time overruns. The paper describes a Robust Priority Assignment algorithm that can find the robust priority ordering for a wide range of fixed priority system models and additional interference functions. Proofs are given for a number of interesting theorems about robust priority assignment, and the circumstances under which a "Deadline minus Jitter" monotonic partial ordering forms part of the robust ordering. The paper shows that "Deadline minus Jitter" monotonic priority ordering is the robust priority ordering for a specific class of system, and that this property holds essentially independent of the additional interference function.

Original language	English
Title of host publication	RTSS 2007: 28th IEEE International Real-Time Systems Symposium, 2007
Place of Publication	Los Alamitos
Publisher	IEEE
Pages	3-14
Number of pages	12
ISBN (Print)	9780769530628
DOIs	https://doi.org/10.1109/RTSS.2007.43
Publication status	Published - Dec 2007
Event	28th IEEE International Real-Time Systems Symposium - Tucson, Arizona, United States Duration: 3 Dec 2007 → 6 Dec 2007

Conference

Conference	28th IEEE International Real-Time Systems Symposium
Country/Territory	United States
City	Tucson, Arizona
Period	3/12/07 → 6/12/07

Keywords

real-time
scheduling
schedulability analysis
priority assignment
fixed priority

Access to Document

10.1109/RTSS.2007.43

Cite this

@inproceedings{295b741aa21340969e6e07a2a3c24b50,

title = "Robust priority assignment for fixed priority real-time systems",

abstract = "This paper focuses on priority assignment for real-time systems using fixed priority scheduling. It introduces and defines the concept of a {"}robust{"} priority ordering: the most appropriate priority ordering to use in a system subject to variable amounts of additional interference from sources such as interrupts, operating system overheads, exception handling, cycle stealing, and task execution time overruns. The paper describes a Robust Priority Assignment algorithm that can find the robust priority ordering for a wide range of fixed priority system models and additional interference functions. Proofs are given for a number of interesting theorems about robust priority assignment, and the circumstances under which a {"}Deadline minus Jitter{"} monotonic partial ordering forms part of the robust ordering. The paper shows that {"}Deadline minus Jitter{"} monotonic priority ordering is the robust priority ordering for a specific class of system, and that this property holds essentially independent of the additional interference function.",

keywords = "real-time, scheduling, schedulability analysis, priority assignment, fixed priority",

author = "Davis, {R. I.} and A. Burns",

year = "2007",

month = dec,

doi = "10.1109/RTSS.2007.43",

language = "English",

isbn = "9780769530628",

pages = "3--14",

booktitle = "RTSS 2007: 28th IEEE International Real-Time Systems Symposium, 2007",

publisher = "IEEE",

address = "United States",

note = "28th IEEE International Real-Time Systems Symposium ; Conference date: 03-12-2007 Through 06-12-2007",

}

TY - GEN

T1 - Robust priority assignment for fixed priority real-time systems

AU - Davis, R. I.

AU - Burns, A.

PY - 2007/12

Y1 - 2007/12

N2 - This paper focuses on priority assignment for real-time systems using fixed priority scheduling. It introduces and defines the concept of a "robust" priority ordering: the most appropriate priority ordering to use in a system subject to variable amounts of additional interference from sources such as interrupts, operating system overheads, exception handling, cycle stealing, and task execution time overruns. The paper describes a Robust Priority Assignment algorithm that can find the robust priority ordering for a wide range of fixed priority system models and additional interference functions. Proofs are given for a number of interesting theorems about robust priority assignment, and the circumstances under which a "Deadline minus Jitter" monotonic partial ordering forms part of the robust ordering. The paper shows that "Deadline minus Jitter" monotonic priority ordering is the robust priority ordering for a specific class of system, and that this property holds essentially independent of the additional interference function.

AB - This paper focuses on priority assignment for real-time systems using fixed priority scheduling. It introduces and defines the concept of a "robust" priority ordering: the most appropriate priority ordering to use in a system subject to variable amounts of additional interference from sources such as interrupts, operating system overheads, exception handling, cycle stealing, and task execution time overruns. The paper describes a Robust Priority Assignment algorithm that can find the robust priority ordering for a wide range of fixed priority system models and additional interference functions. Proofs are given for a number of interesting theorems about robust priority assignment, and the circumstances under which a "Deadline minus Jitter" monotonic partial ordering forms part of the robust ordering. The paper shows that "Deadline minus Jitter" monotonic priority ordering is the robust priority ordering for a specific class of system, and that this property holds essentially independent of the additional interference function.

KW - real-time

KW - scheduling

KW - schedulability analysis

KW - priority assignment

KW - fixed priority

U2 - 10.1109/RTSS.2007.43

DO - 10.1109/RTSS.2007.43

M3 - Conference contribution

SN - 9780769530628

SP - 3

EP - 14

BT - RTSS 2007: 28th IEEE International Real-Time Systems Symposium, 2007

PB - IEEE

CY - Los Alamitos

T2 - 28th IEEE International Real-Time Systems Symposium

Y2 - 3 December 2007 through 6 December 2007

ER -