Scalable reader-writer synchronization for shared-memory multiprocessors
John Mellor‐Crummey, Michael Lee Scott · ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming · 1991
Reader-writer synchronization relaxes the constraints of mutual exclusion to permit more than one process to inspect a shared object concurrently, as long as none of them changes its value.On uniprocessors, mutual exclusion and readercessor demonstrate that our algorithms provide low latency and excellent scalability.
Cited by 128 works. doi:10.1145/109625.109637 Open-access PDF
Authors
References
- Concurrent control with “readers” and “writers”
- A new solution of Dijkstra's concurrent programming problem
- Algorithms for scalable synchronization on shared-memory multiprocessors
- “Hot spot” contention and combining in multistage interconnection networks
- The performance of spin lock alternatives for shared-memory multiprocessors
- A methodology for implementing highly concurrent data structures
- A methodology for implementing highly concurrent data structures
- Synchronization algorithms for shared-memory multiprocessors
- Efficient synchronization of multiprocessors with shared memory
- Efficient synchronization of multiprocessors with shared memory