Semaphore primitives and starvation-free mutual exclusion
- 1 October 1982
- journal article
- Published by Association for Computing Machinery (ACM) in Journal of the ACM
- Vol. 29 (4) , 1049-1072
- https://doi.org/10.1145/322344.322352
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared VariableJournal of the ACM, 1982
- Formal verification of parallel programsCommunications of the ACM, 1976
- ReductionCommunications of the ACM, 1975
- Multiprogramming CoordinationACM Computing Surveys, 1975
- Limitations of Dijkstra's Semaphore Primitives and Petri netsPublished by Association for Computing Machinery (ACM) ,1973
- Synchronization of communicating processesCommunications of the ACM, 1972
- Comments on ?A comparison of two synchronizing concepts by P.B. Hansen?Acta Informatica, 1972
- Concurrent control with “readers” and “writers”Communications of the ACM, 1971
- Hierarchical ordering of sequential processesActa Informatica, 1971
- Additional comments on a problem in concurrent programming controlCommunications of the ACM, 1966