Using large families for handling priority requests
- 1 January 1987
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGAda Ada Letters
- Vol. VII (1) , 97-104
- https://doi.org/10.1145/24611.24619
Abstract
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.Keywords
This publication has 1 reference indexed in Scilit:
- A problem with Ada and resource allocationACM SIGAda Ada Letters, 1984