A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM

DOI10.1145/3293611.3331634OpenAlexW2963078385MaRDI QIDQ5145198FDOQ5145198

Anup Joshi, S. Jayanti, Prasad Jayanti

Publication date: 20 January 2021

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

Full work available at URL: https://arxiv.org/abs/1904.02124

zbMATH Keywords

synchronizationfault toleranceshared memorymutual exclusionmulti-core algorithmsnon-volatile main memoryconcurrent algorithmrecoverable algorithm

Mathematics Subject Classification ID

Distributed algorithms (68W15) Distributed systems (68M14)

Cited In (3)

• Recoverable mutual exclusion
• Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
• Recoverable mutual exclusion with abortability

This page was built for publication: A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM

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