Supporting Deadlines and EDF Scheduling in Ada
A. Burns, A.J. Wellings and T. Taft
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.
Download Not Available
BibTex Entry
@inproceedings{Burns2004,
author = {A. Burns and A.J. Wellings and T. Taft},
booktitle = {Proceedings Reliable Software Technologies - Ada Europe},
editor = {A. Llamosi and A. Strohmeier},
pages = {156--165},
series = {Springer},
title = {Supporting Deadlines and EDF Scheduling in Ada},
volume = {LNCS 3063},
year = {2004}
}