Task attribute-based scheduling: extending Ada's support for scheduling

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

Citing 6
Cited 0

Stack-based scheduling for realtime processes

Real-Time Systems
The Ravenscar Profile

ACM SIGAda Ada Letters
Extending Ada's real-time systems annex with the POSIX scheduling services

IRTAW '00 Proceedings of the 10th international workshop on Real-time Ada workshop
Application-defined scheduling in Ada

IRTAW '02 Proceedings of the 11th international workshop on Real-time Ada workshop
The Ravenscar Tasking Profile for High Integrity Real-Time Programs

Ada-Europe '98 Proceedings of the 1998 Ada-Europe International Conference on Reliable Software Technologies
A round robin scheduling policy for Ada

Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

Scheduling policies are of crucial importance to realtime 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 new paradigms such as Earliest Deadline First (EDF), and combined paradigms. Possible extensions to the language in the form of new pragmas are described.