Concurrent programming in Ada
Synthesis of Mutual Exclusion Solutions Based on Binary Semaphores
IEEE Transactions on Software Engineering
An efficient starvation-free semaphore solution for the graphical mutual exclusion problem
The Computer Journal - Special issue: Concurrent programming
Semaphore primitives and starvation-free mutual exclusion
Journal of the ACM (JACM)
Reference Manual for the ADA Programming Language
Reference Manual for the ADA Programming Language
ACM SIGAda Ada Letters
Ada and the control of intrusion
ACM SIGAda Ada Letters
| Hi-index | 0.00 |
Although some specific mutual exclusion problems have been studied extensively, automatic solutions to synchronize general mutual exclusion problems with arbitrary mutual exclusion constraints have not been fully explored. This paper discusses an Ada 83 solution that can be applied to any general mutual exclusion problem. This solution is based on strong binary semaphores. A generic package is used to generate the solution for an given mutual exclusion problem. An Ada program for the simulation of the classical Dining Philosophers Problem is presented as an example to demostrate how the solution can be used.