Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

DOI10.1145/3583668.3594597MaRDI QIDQ6202227zbMATH OpenFDO

Authors David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel

Publication date 26 March 2024

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

zbMATH Keywords

concurrencyfault toleranceshared memorymutual exclusioncritical sectionrecoverable mutual exclusionRME

Mathematics Subject Classification ID

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

Cites work

• scientific article; zbMATH DE number 5485533 (Why is no real title available?)
• A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
• A fast, scalable mutual exclusion algorithm
• An Adaptive Approach to Recoverable Mutual Exclusion
• An improved lower bound for the time complexity of mutual exclusion
• Extremal combinatorics. With applications in computer science
• RMR-efficient implementations of comparison primitives using read and write operations
• Recoverable FCFS mutual exclusion with wait-free recovery
• Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives
• Recoverable mutual exclusion
• Recoverable mutual exclusion in sub-logarithmic time
• Recoverable mutual exclusion under system-wide failures
• Recoverable mutual exclusion with abortability

This page was built for publication: Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

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