Supporting Deadlines and EDF Scheduling in Ada

Alan Burns; Andy J. Wellings

doi:10.1007/978-3-540-24841-5_12

Supporting Deadlines and EDF Scheduling in Ada

Alan Burns, Andy J. Wellings

Computer Science

Research output: Contribution to conference › Paper › peer-review

Abstract

Scheduling policies are of crucial importance to real-time systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support another common paradigm, Earliest Deadline First (EDF). A proposal is described that uses standard priorities and the priority ceiling protocol for protected objects.

Original language	Undefined/Unknown
Pages	156-165
DOIs	https://doi.org/10.1007/978-3-540-24841-5_12
Publication status	Published - 2004

Access to Document

10.1007/978-3-540-24841-5_12

http://springerlink.metapress.com/openurl.asp?genre=articleissn=0302-9743volume=3063spage=156

Cite this

@conference{b414eb7e5c57447a902d08effca82b8d,

title = "Supporting Deadlines and EDF Scheduling in Ada",

abstract = "Scheduling policies are of crucial importance to real-time systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support another common paradigm, Earliest Deadline First (EDF). A proposal is described that uses standard priorities and the priority ceiling protocol for protected objects. ",

author = "Alan Burns and Wellings, {Andy J.}",

year = "2004",

doi = "10.1007/978-3-540-24841-5_12",

language = "Undefined/Unknown",

pages = "156--165",

}

TY - CONF

T1 - Supporting Deadlines and EDF Scheduling in Ada

AU - Burns, Alan

AU - Wellings, Andy J.

PY - 2004

Y1 - 2004

N2 - Scheduling policies are of crucial importance to real-time systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support another common paradigm, Earliest Deadline First (EDF). A proposal is described that uses standard priorities and the priority ceiling protocol for protected objects.

AB - Scheduling policies are of crucial importance to real-time systems. Ada currently gives full support to the most popular policy, fixed priority dispatching. In this paper we argue that the language should be extended to support another common paradigm, Earliest Deadline First (EDF). A proposal is described that uses standard priorities and the priority ceiling protocol for protected objects.

U2 - 10.1007/978-3-540-24841-5_12

DO - 10.1007/978-3-540-24841-5_12

M3 - Paper

SP - 156

EP - 165

ER -