Generalizing the EDF scheduling support in Ada 2005

Authors:
A. J. Wellings;A. Burns
Affiliations:
University of York, Heslington, York, UK;University of York, Heslington, York, UK
Venue:
ACM SIGAda Ada Letters
Year:
2010

Citing 2
Cited 0

Stack-based scheduling for realtime processes

Real-Time Systems
Concurrent and Real-Time Programming in Ada

Concurrent and Real-Time Programming in Ada

Quantified Score

Hi-index	0.00

Visualization

Abstract

Ada 2005 has introduced a version of Baker's Stack Resource Protocol called the Preemption Level Control Protocol in order to support EDF scheduling. Baker's protocol is, however, a general protocol that can be used with a range of scheduling algorithms, for example any static job-level algorithm such as static values or a modified least laxity algorithm. This paper investigates the changes that would be needed to Ada 2005 to allow it to support user-defined scheduling, where the user can implement any scheduling approach that is compatible with Baker's algorithm.