Concurrent Reading While Writing
Gary L. Peterson · ACM Transactions on Programming Languages and Systems · 1983
While WritingThe problem of asynchronous processes reading shared data while the data are being modified by another process is considered.This problem differs from the standard readers/writers problem in that concurrent reading while writing is allowed.The model used here strongly limits the use and size of the shared variables.If multiple copies of the shared data are allowed, then simple, efficient solutions are found.In general, solutions which are more time efficient because they avoid waiting are seen to require more copies of the shared data.The number of copies used by all algorithms is shown to be the best possible.The main solution demonstrates that any system of processes which uses large distributed variables can be strongly simulated by a system which uses only binary distributed variables.
Cited by 170 works. doi:10.1145/357195.357198 Open-access PDF
Authors
References
- Concurrent control with “readers” and “writers”
- Concurrent Programming Concepts
- A comparison of two synchronizing concepts
- Concurrent reading and writing
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- A new solution to the critical section problem
- A Real-Time System Design Methodology*
- Time-space trade-offs for asynchronous parallel models (Reducibilities and Equivalences)
- Conference record of the 11th annual ACM symposium on theory of computing