ABSTRACT
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.
- C.D. Cornhil, "Tasking Session Summary" Proceeding of the 1st International Workshop on Real Time Ada Issues Moretonhampstead, Devon, UK. 1987 Ada Letters Vol. VII, Num. 6, Fall 1987.Google Scholar
- EM1.T. Elrad, F. Maymir-Ducharme "Introducing the Preference Control Primitive: "Experience with Controlling Nondeterminism in Ada", Proceedings of the 1986 Washington Ada Symposium in Lurel, Maryland, March 24 - 26, 1986. Google ScholarDigital Library
- EM2.T. Elrad, F. Maymir-Ducharme, "Efficiently Controlling Communication in Ada Using Preference Control", Proceedings of the IEEE 1986 Military Communications Conference in Monterey, California, October 5-9, 1986.Google Scholar
- EM3.T. Elrad, F. Maymir " Satisfying Emergency Communication Requirements With Dynamic Preference Control" Proceeding of the Sixth Annual National Conference on Ada Technology , Mach 14-17 1988.Google Scholar
- GR.N. Gehani, W. Roome "Concurrent-C*" AT&T Bell Lab. Murray Hill, New Jersy. 07974, 1985.Google Scholar
Index Terms
- Comprehensive scheduling controls for Ada tasking
Recommendations
Comprehensive scheduling controls for Ada tasking
Special edition: International Workshop on Real-Time Ada IssuesOne 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,...
Mixing coroutines and processes in an Ada tasking implementation
Not all tasks in an Ada program make use of the full functionality defined in the language reference manual. Certain idiomatic uses of Ada tasks allow these tasks to be implemented as coroutines. This paper presents a method for mixing coroutines and ...
Comments