By the same authors

Supporting Deadlines and EDF Scheduling in Ada

Research output: Contribution to conferencePaper

Author(s)

Department/unit(s)

Publication details

DatePublished - 2004
Original languageUndefined/Unknown

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.

Discover related content

Find related publications, people, projects, datasets and more using interactive charts.

View graph of relations