An alternative to event queues for synchronization in monitors
- 1 July 1977
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 20 (7) , 500-503
- https://doi.org/10.1145/359636.359710
Abstract
In the monitor concept, as proposed by Brinch Hansen and Hoare, event queues are used for synchronization. This paper describes another synchronizing primitive which is nearly as expressive as the conditional wait, but can be implemented more efficiently. An implementation of this primitive in terms of P and V operations is given together with a correctness proof. Two examples are presented: the readers and writers problem and the problem of information streams sharing a finite buffer pool.Keywords
This publication has 6 references indexed in Scilit:
- Proving monitorsCommunications of the ACM, 1976
- Constructing correct and efficient concurrent programsPublished by Association for Computing Machinery (ACM) ,1975
- MonitorsCommunications of the ACM, 1974
- Information streams sharing a finite bufferInformation Processing Letters, 1972
- Concurrent control with “readers” and “writers”Communications of the ACM, 1971
- Performance predictions for extended paged memoriesActa Informatica, 1971