Non-Preemptive Dispatching and Locking Policies
A. Burns
In this short paper two new pragmas are introduced and defined. Together they allow non-preemptive scheduling to be specified for Ada Programs. The syntax, rules and dynamic semantics for the scheme are described. Use is made of an additional execution resource -- the execution-token.
Download Not Available
BibTex Entry
@article{Burns2001a,
author = {A. Burns},
category = {scheduling,languages},
journal = {Ada Letters},
month = {Mar},
number = {1},
pages = {46--47},
title = {Non-Preemptive Dispatching and Locking Policies},
volume = {XX1},
year = {2001}
}