On the Complexity of Reader-Writer Locks

DOI10.1145/2933057.2933099MaRDI QIDQ5361950zbMATH OpenOpenAlexFDO

Authors Danny Hendler

Publication date 29 September 2017

Published in Proceedings of the 2016 ACM Symposium on Principles of Distributed Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2933057.2933099

zbMATH Keywords

compare and swapreader-writer-lockremote memory references

Mathematics Subject Classification ID

Distributed systems (68M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• A tight bound on remote reference time complexity of mutual exclusion in the read-modify-write model
• A fair Banker's Algorithm for read and write locks
• scientific article; zbMATH DE number 7699455
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• Formal verification of concurrent programs with Read-write locks
• scientific article; zbMATH DE number 4049031
• Distributed Computing
• scientific article; zbMATH DE number 2006640

Cited in

(5)

• Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
• Constant RMR solutions to reader writer synchronization
• scientific article; zbMATH DE number 7699455 (Why is no real title available?)
• Iterative computations with ordered read-write locks
• Spin-based reader-writer synchronization for multiprocessor real-time systems

This page was built for publication: On the Complexity of Reader-Writer Locks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5361950)