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.
Cite
CITATION STYLE
Burns, A. (2001). Defining new non-preemptive dispatching and locking policies for Ada. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2043, pp. 328–336). Springer Verlag. https://doi.org/10.1007/3-540-45136-6_26
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
