Non-preemptive dispatching and locking policies
Alan Burns · ACM SIGAda Ada Letters · 2001
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.