Comments on “a correct and unrestrictive implementation of general semaphores”
- 3 January 1989
- journal article
- Published by Association for Computing Machinery (ACM) in ACM SIGOPS Operating Systems Review
- Vol. 23 (1) , 7-8
- https://doi.org/10.1145/65762.65763
Abstract
Semaphore, with undefined result. Furthermore, Kearns uses a counter, s.wakecount to record the number of pending wakeup signals not yet consumed by the processes that are in the midst of executing P operations. However, since each increment of s.wakecount by a V does a VB(s.delay), and each process engaged in the P also does VB(s.delay) when s.wakecount > 0, if there are N suspended processes when N V's are done, there will be 2N-1 VB's executed. Both mistakes can be corrected by adding the italicized line to his code for V:Keywords
This publication has 4 references indexed in Scilit:
- A correct and unrestrictive implementation of general semaphoresACM SIGOPS Operating Systems Review, 1988
- A correct implementation of general semaphoresACM SIGOPS Operating Systems Review, 1988
- Implementing semaphores by binary semaphoresACM SIGPLAN Notices, 1983
- Hierarchical ordering of sequential processesActa Informatica, 1971