On the Complexity of Reader-Writer Locks

DOI10.1145/2933057.2933099zbMath1375.68029OpenAlexW2490111015MaRDI QIDQ5361950

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 swapremote memory referencesreader-writer-lock

Mathematics Subject Classification ID

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

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