Programming in Ada (2nd ed.)
Concurrent programming in Ada
A review of Ada tasking
A problem with Ada and resource allocation
ACM SIGAda Ada Letters
Occam Programming Manual
ACM SIGAda Ada Letters
Limitations of Ada for real-time scheduling
IRTAW '87 Proceedings of the first international workshop on Real-time Ada issues
IRTAW '87 Proceedings of the first international workshop on Real-time Ada issues
Ada's abort statement: license to kill
ACM SIGAda Ada Letters
Real-time software engineering in Ada: observations and recommendations
TRI-Ada '89 Proceedings of the conference on Tri-Ada '89: Ada technology in context: application, development, and deployment
Usability of the Ada tasking-model
IRTAW '89 Proceedings of the third international workshop on Real-time Ada issues
Multitasking, scheduling: approaches for Ada
WADAS '90 Proceedings of the seventh Washington Ada symposium on Ada
| Hi-index | 0.00 |
With ordinary task entries, requests are handled strictly in the order in which they arrive at the called task. To circumvent this rule, for prioritised requests, the Ada language provides entry families. Unfortunately the programming of a reliable algorithm for a large number of priority levels is non-trivial. This paper reviews the "solutions" usually given and derives an acceptable, if somewhat complex, algorithm. Suggestions for improvements in the facilities Ada provides are also presented.