Defining New Non-preemptive Dispatching and Locking Policies for Ada

Authors:
Alan Burns
Affiliations:
-
Venue:
Ada Europe '01 Proceedings of the 6th Ade-Europe International Conference Leuven on Reliable Software Technologies
Year:
2001

Citing 4
Cited 0

Restricted tasking models

IRTAW '97 Proceedings of the eighth international workshop on Real-Time Ada
The Ravenscar Profile and implementation issues (session summary)

IRTAW '99 Proceedings of the ninth international workshop on Real-time Ada
Non-preemptive dispatching and locking policies

IRTAW '00 Proceedings of the 10th international workshop on Real-time Ada workshop
Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX

Real-Time Systems and Programming Languages: ADA 95, Real-Time Java, and Real-Time POSIX

Quantified Score

Hi-index	0.00

Visualization

Abstract

In many high-integrity applications, non-preemptive execution is preferred. This paper motivates and defines such a dispatching policy for Ada. It also describes an associated locking policy for protected objects. To deliver non-preemptive execution a new processing resource is introduced - the execution token. In addition to defining these new policies the paper also reviews how non-preemptive tasking systems can be analysed for their schedulability.