Correcting the EDF protocol in Ada 2005

Authors:
A. Zerzelidis;A. Burns;A. J. Wellings
Affiliations:
University of York, UK;University of York, UK;University of York, UK
Venue:
IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
Year:
2007

Citing 1
Cited 8

Stack-based scheduling for realtime processes

Real-Time Systems

Introduction

IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
Summary

IRTAW '07 Proceedings of the 13th international workshop on Real-time Ada
Real-time synchronization on distributed architecture with Ada-2005

Proceedings of the 2008 ACM annual international conference on SIGAda annual international conference
Implementation of the Ada 2005 Task Dispatching Model in MaRTE OS and GNAT

Ada-Europe '09 Proceedings of the 14th Ada-Europe International Conference on Reliable Software Technologies
Implementing and verifying EDF preemption-level resource control

Ada-Europe'12 Proceedings of the 17th Ada-Europe international conference on Reliable Software Technologies
An EDF run-time profile based on ravenscar

ACM SIGAda Ada Letters
Ada 2012: resource sharing and multiprocessors

ACM SIGAda Ada Letters
Incorporating the deadline floor protocol in ada

ACM SIGAda Ada Letters

Quantified Score

Hi-index	0.00

Visualization

Abstract

Earliest Deadline First (EDF) dispatching has been introduced into the Ada 2005 definition. Included in this definition is support for Baker's protocol for preemption level control over access to protected objects. Unfortunately the current model fails to implement all the situations covered by Baker's approach. A counter example is provided that illustrates this deficiency with the language as currently defined. A minor change to the language definition is proposed that removes the flaw.