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

DOI10.1145/3293611.3331634MaRDI QIDQ5145198OpenAlexFDO

Authors Prasad Jayanti, Anup Joshi, S. 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)

Recommendations

• Recoverable mutual exclusion with abortability
• Recoverable mutual exclusion in sub-logarithmic time
• Recoverable FCFS mutual exclusion with wait-free recovery
• Recoverable mutual exclusion under system-wide failures
• Constant Amortized RMR Abortable Mutex for CC and DSM

Cited in

(3)

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

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)