Appropriate mechanisms for the support of optional processing in hard real-time systems

N. C. Audsley; R.I. Davis; A. Burns; A. J. Wellings

doi:10.1109/RTOSS.1994.292567

Appropriate mechanisms for the support of optional processing in hard real-time systems

N. C. Audsley, R.I. Davis, A. Burns, A. J. Wellings

Computer Science

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

Abstract

It has been recognised that future hard real-time systems need to be more flexible than current scheduling theory permits. One method of increasing flexibility is the incorporation, at run-time, of optional components into processes with hard deadlines. Such components are not guaranteed offline, but may be guaranteed at run-time if sufficient resources are available. This is achieved by providing mechanisms within the kernel for run-time monitoring of spare processor capacity and its subsequent assignment to requesting processes. This paper examines these mechanisms within the context of fixed priority preemptive scheduling

Original language	English
Title of host publication	IEEE Workshop on Real-Time Operating Systems and Software
Pages	23-27
DOIs	https://doi.org/10.1109/RTOSS.1994.292567
Publication status	Published - May 1994

Keywords

real-time
fixed priority
scheduling
gain time
spare capacity

Access to Document

10.1109/RTOSS.1994.292567

http://www-users.cs.york.ac.uk/~robdavis/

Cite this

@inproceedings{17daf93ca0bb4d6d93fbc3e5406ab63c,

title = "Appropriate mechanisms for the support of optional processing in hard real-time systems",

abstract = "It has been recognised that future hard real-time systems need to be more flexible than current scheduling theory permits. One method of increasing flexibility is the incorporation, at run-time, of optional components into processes with hard deadlines. Such components are not guaranteed offline, but may be guaranteed at run-time if sufficient resources are available. This is achieved by providing mechanisms within the kernel for run-time monitoring of spare processor capacity and its subsequent assignment to requesting processes. This paper examines these mechanisms within the context of fixed priority preemptive scheduling",

keywords = "real-time, fixed priority, scheduling, gain time, spare capacity",

author = "Audsley, {N. C.} and R.I. Davis and A. Burns and Wellings, {A. J.}",

year = "1994",

month = may,

doi = "10.1109/RTOSS.1994.292567",

language = "English",

pages = "23--27",

booktitle = "IEEE Workshop on Real-Time Operating Systems and Software",

}

TY - GEN

T1 - Appropriate mechanisms for the support of optional processing in hard real-time systems

AU - Audsley, N. C.

AU - Davis, R.I.

AU - Burns, A.

AU - Wellings, A. J.

PY - 1994/5

Y1 - 1994/5

N2 - It has been recognised that future hard real-time systems need to be more flexible than current scheduling theory permits. One method of increasing flexibility is the incorporation, at run-time, of optional components into processes with hard deadlines. Such components are not guaranteed offline, but may be guaranteed at run-time if sufficient resources are available. This is achieved by providing mechanisms within the kernel for run-time monitoring of spare processor capacity and its subsequent assignment to requesting processes. This paper examines these mechanisms within the context of fixed priority preemptive scheduling

AB - It has been recognised that future hard real-time systems need to be more flexible than current scheduling theory permits. One method of increasing flexibility is the incorporation, at run-time, of optional components into processes with hard deadlines. Such components are not guaranteed offline, but may be guaranteed at run-time if sufficient resources are available. This is achieved by providing mechanisms within the kernel for run-time monitoring of spare processor capacity and its subsequent assignment to requesting processes. This paper examines these mechanisms within the context of fixed priority preemptive scheduling

KW - real-time

KW - fixed priority

KW - scheduling

KW - gain time

KW - spare capacity

U2 - 10.1109/RTOSS.1994.292567

DO - 10.1109/RTOSS.1994.292567

M3 - Conference contribution

SP - 23

EP - 27

BT - IEEE Workshop on Real-Time Operating Systems and Software

ER -