APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING

N Audsley; A Burns; M Richardson; K Tindell; A J Wellings

APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING

N Audsley, A Burns, M Richardson, K Tindell, A J Wellings

Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

The paper presents exact schedulability analyses for real-time systems scheduled at runtime with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) to release jitter, such as waiting for a message to arrive. The analysis presented is more general than that previously published and subsumes, for example, techniques based on the Rate Monotonic approach. In addition to presenting the relevant theory, an existing avionics case study is described and analysed. The predictions that follow from this analysis are seen to be in close agreement with the behaviour exhibited during simulation studies.

Original language	English
Pages (from-to)	284-292
Number of pages	9
Journal	Software Engineering Journal
Volume	8
Issue number	5
Publication status	Published - Sept 1993

Keywords

TIME

Cite this

@article{0df7cb07187046d3871d2164276e527e,

title = "APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING",

abstract = "The paper presents exact schedulability analyses for real-time systems scheduled at runtime with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) to release jitter, such as waiting for a message to arrive. The analysis presented is more general than that previously published and subsumes, for example, techniques based on the Rate Monotonic approach. In addition to presenting the relevant theory, an existing avionics case study is described and analysed. The predictions that follow from this analysis are seen to be in close agreement with the behaviour exhibited during simulation studies.",

keywords = "TIME",

author = "N Audsley and A Burns and M Richardson and K Tindell and Wellings, {A J}",

year = "1993",

month = sep,

language = "English",

volume = "8",

pages = "284--292",

journal = "Software Engineering Journal",

issn = "2053-910X",

publisher = "Institution of Engineering & Technology",

number = "5",

}

TY - JOUR

T1 - APPLYING NEW SCHEDULING THEORY TO STATIC PRIORITY PREEMPTIVE SCHEDULING

AU - Audsley, N

AU - Burns, A

AU - Richardson, M

AU - Tindell, K

AU - Wellings, A J

PY - 1993/9

Y1 - 1993/9

N2 - The paper presents exact schedulability analyses for real-time systems scheduled at runtime with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) to release jitter, such as waiting for a message to arrive. The analysis presented is more general than that previously published and subsumes, for example, techniques based on the Rate Monotonic approach. In addition to presenting the relevant theory, an existing avionics case study is described and analysed. The predictions that follow from this analysis are seen to be in close agreement with the behaviour exhibited during simulation studies.

AB - The paper presents exact schedulability analyses for real-time systems scheduled at runtime with a static priority pre-emptive dispatcher. The tasks to be scheduled are allowed to experience internal blocking (from other tasks with which they share resources) and (with certain restrictions) to release jitter, such as waiting for a message to arrive. The analysis presented is more general than that previously published and subsumes, for example, techniques based on the Rate Monotonic approach. In addition to presenting the relevant theory, an existing avionics case study is described and analysed. The predictions that follow from this analysis are seen to be in close agreement with the behaviour exhibited during simulation studies.

KW - TIME

M3 - Article

SN - 2053-910X

VL - 8

SP - 284

EP - 292

JO - Software Engineering Journal

JF - Software Engineering Journal

IS - 5

ER -