A Fair Fast Scalable Rea,der-Writer Lock

Authors:
Orran Krieger;Michael Stumm;Ron Unrau;Jonathan Hanna
Affiliations:
University of Toronto,Canada;University of Toronto,Canada;University of Toronto,Canada;University of Toronto,Canada
Venue:
ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 02
Year:
1993

Citing 0
Cited 9

A Fair Fast Distributed Concurrent-Reader Exclusive-Writer Synchronization

FRONTIERS '96 Proceedings of the 6th Symposium on the Frontiers of Massively Parallel Computation
Experience distributing objects in an SMMP OS

ACM Transactions on Computer Systems (TOCS)
Critical sections: re-emerging scalability concerns for database storage engines

Proceedings of the 4th international workshop on Data management on new hardware
Scalable reader-writer locks

Proceedings of the twenty-first annual symposium on Parallelism in algorithms and architectures
An annotation assistant for interactive debugging of programs with common synchronization idioms

Proceedings of the 7th Workshop on Parallel and Distributed Systems: Testing, Analysis, and Debugging
Iterative computations with ordered read-write locks

Journal of Parallel and Distributed Computing
Spin-based reader-writer synchronization for multiprocessor real-time systems

Real-Time Systems
Architectural Support for Fair Reader-Writer Locking

MICRO '43 Proceedings of the 2010 43rd Annual IEEE/ACM International Symposium on Microarchitecture
Simplifying linearizability proofs with reduction and abstraction

TACAS'10 Proceedings of the 16th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

A reader-writer (RW) lock allows either multiple readers to inspect shared data or a single writer exclusive access for modifying that data. On shared memory multiprocessors,cost of acquiring and releasing these locks can have a large impact on the performance of parallel applications. A major problem with naive implementations of these locks, where processors spin on a global lock variable waiting for the lock to become available, is that the memory containing the lock and the interconnection network to that memory will also become contended when the lock is contended.