Semaphores outside the kernel
- 1 October 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGPLAN Notices
- Vol. 19 (10) , 12-21
- https://doi.org/10.1145/948290.948291
Abstract
We present three new implementations of semaphores for V7 UNIX. None require kernel modifications. The canonical UNIX semaphore method uses link O in a spin loop. The first new method replaces the canonical spin loop with a software trap mechanism, the second provides additional enhancements in the form of a pool of semaphores and explicit quene management, and the third is a distributed protocol extending to the ability for synchronizing in network environments.Keywords
This publication has 9 references indexed in Scilit:
- Application of an optimistic concurrency control methodSoftware: Practice and Experience, 1984
- An optimal algorithm for mutual exclusion in computer networksCommunications of the ACM, 1981
- Experience with processes and monitors in Mesa (Summary)Published by Association for Computing Machinery (ACM) ,1979
- Fundamentals of Operating SystemsPublished by Springer Nature ,1979
- Distributed processesCommunications of the ACM, 1978
- Communicating sequential processesCommunications of the ACM, 1978
- The programming language Concurrent PascalIEEE Transactions on Software Engineering, 1975
- Additional comments on a problem in concurrent programming controlCommunications of the ACM, 1966
- Solution of a problem in concurrent programming controlCommunications of the ACM, 1965