Introducing the preference control primitive experience with controlling nondeterminism in Ada
WADAS '86 Proceedings of the third annual Washington Ada symposium on Ada: Ada use in focus : practical lessons in perspective
Deterministic priority inversion in Ada selective waits
ACM SIGAda Ada Letters
The analysis and comparison of scheduling controls in concurrent languages through classification
SIGCSE '90 Proceedings of the twenty-first SIGCSE technical symposium on Computer science education
Priority inversion in Ada programs during elaboration
WADAS '90 Proceedings of the seventh Washington Ada symposium on Ada
The Practical Use of Ada 95's Concurrency Features
IEEE Concurrency
| Hi-index | 0.00 |
One of the functions for which Ada needs more expressive power is scheduling control. Scheduling controls provide a mechanism for comprehensive scheduling.In order to evaluate any concurrent language for its ability to control a multi-events environment, we need to have a general set for classifying all possible controls. Such a classification can exploit the expressive power of any concurrent language, and thus be used to provide us with a priori knowledge regarding the capacity of the language to be used for a specific application. It will also enable us to suggest the best environment for the application at hand. Evaluating Ada against these control capacities will provide us with a scientific approach to the issue of forming an integrated design of comprehensive scheduling controls for Ada.