Concurrent programming in Ada
An efficient starvation-free semaphore solution for the graphical mutual exclusion problem
The Computer Journal - Special issue: Concurrent programming
An Ada solution to the general mutual exclusion problem
ACM SIGAda Ada Letters
Programming in Ada95
Synchronization Problems Solvable by Generalized PV Systems
Journal of the ACM (JACM)
Semaphore primitives and starvation-free mutual exclusion
Journal of the ACM (JACM)
Translation of the protected type mechanism in Ada 83
ACM SIGAda Ada Letters
Priority ceiling protocol in Ada
Proceedings of the conference on TRI-Ada '96: disciplined software development with Ada
Ada and the control of intrusion
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
The new protected type and requeue features in Ada-94 make possible the efficient implementations of many concurrent solutions, previously not possible in Ada-83. In this paper, the implementations of various semaphore systems in Ada-94 are presented. These systems are more general and powerful than the familiar binary and counting semaphores. As examples, the uses of the most general one, PVgeneral, in resource management and the synchronization of general mutual exclusion problems are discussed.