Generalizing the EDF scheduling support in Ada 2005

A. J. Wellings; A. Burns

doi:http://doi.acm.org/10.1145/1806546.1806559

Generalizing the EDF scheduling support in Ada 2005

A. J. Wellings, A. Burns

Computer Science

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

Abstract

Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.

Original language	Undefined/Unknown
Pages (from-to)	116-124
Number of pages	9
Journal	ACM Ada Letters
Volume	30
Issue number	1
DOIs	https://doi.org/http://doi.acm.org/10.1145/1806546.1806559
Publication status	Published - 2010

Access to Document

http://doi.acm.org/10.1145/1806546.1806559

Cite this

@article{b771a05d33e34def924f92ebf83151d6,

title = "Generalizing the EDF scheduling support in Ada 2005",

abstract = "Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.",

author = "Wellings, {A. J.} and A. Burns",

year = "2010",

doi = "http://doi.acm.org/10.1145/1806546.1806559",

language = "Undefined/Unknown",

volume = "30",

pages = "116--124",

journal = "ACM Ada Letters",

issn = "1094-3641",

number = "1",

}

TY - JOUR

T1 - Generalizing the EDF scheduling support in Ada 2005

AU - Wellings, A. J.

AU - Burns, A.

PY - 2010

Y1 - 2010

N2 - Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.

AB - Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.

U2 - http://doi.acm.org/10.1145/1806546.1806559

DO - http://doi.acm.org/10.1145/1806546.1806559

M3 - Article

SN - 1094-3641

VL - 30

SP - 116

EP - 124

JO - ACM Ada Letters

JF - ACM Ada Letters

IS - 1

ER -