Supporting Deadlines and EDF Scheduling in Ada

Research output: Contribution to conferencePaperpeer-review


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 languageUndefined/Unknown
Publication statusPublished - 2004

Cite this