By the same authors

From the same journal

A deadline-floor inheritance protocol for EDF scheduled embedded real-time systems with resource sharing

Research output: Contribution to journalArticle

Published copy (DOI)

Author(s)

  • Alan Burns
  • Marina Gutierrez
  • Mario Aldea
  • Michael Gonzalez Harbour

Department/unit(s)

Publication details

JournalIEEE Transactions on Computers
DatePublished - 1 May 2015
Issue number5
Volume64
Number of pages13
Pages (from-to)1241-1253
Original languageEnglish

Abstract

Earliest Deadline First (EDF) is the most widely studied optimal dynamic scheduling algorithm for uniprocessor real-time systems. For realistic programs, tasks must be allowed to exchange data and use other forms of resources that must be accessed under mutual exclusion. With EDF scheduled systems, access to such resources is usually controlled by the use of Baker's Stack Resource Protocol (SRP). In this paper we propose an alternative scheme based on deadline inheritance. Shared resources are assigned a relative deadline equal to the minimum (floor) of the relative deadlines of all tasks that use the resource. On entry to the resource a task's current absolute deadline is subject to an immediately reduction to reflect the resource's deadline floor. On exit the original deadline for the task is restored. We show that the worst-case behaviour of the new protocol (termed DFP - Deadline Floor inheritance Protocol) is the same as SRP. Indeed it leads to the same blocking term in the scheduling analysis. We argue that the new scheme is however more intuitive, removes the need to support preemption levels and we demonstrate that it can be implemented more efficiently.

Discover related content

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

View graph of relations