A fast mutual exclusion algorithm
ACM Transactions on Computer Systems (TOCS)
Concurrent Programming Concepts
ACM Computing Surveys (CSUR)
Synchronization with eventcounts and sequencers
Communications of the ACM
Concurrent reading and writing
Communications of the ACM
On a solution to the cigarette smoker's problem (without conditional statements)
Communications of the ACM
Monitors: an operating system structuring concept
Communications of the ACM
Concurrent control with “readers” and “writers”
Communications of the ACM
Additional comments on a problem in concurrent programming control
Communications of the ACM
Solution of a problem in concurrent programming control
Communications of the ACM
1983 Invited address solved problems, unsolved problems and non-problems in concurrency
PODC '84 Proceedings of the third annual ACM symposium on Principles of distributed computing
| Hi-index | 0.00 |
Sharing the components of a data object among asynchronous processes is discussed in the context of the classic “Readers and Writers” problem. Distinct process groups identified as “Readers” and “Writers” contend for access to the data object with the provision that “Readers” may operate in a mutually concurrent way while “Writers” require exclusive access to the object. Two solutions are presented based on the use of replicated versions of the data object. The first algorithm solves a potential starvation problem persistent in previously reported solutions, while the second eliminates synchronization requirements between “Readers” and “Writers” by incorporating an optimized retry mechanism.