Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

DOI10.1145/3583668.3594597MaRDI QIDQ6202227

George Giakkoupis, Philipp Woelfel, David Yu Cheng Chan

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

fault toleranceconcurrencyshared memorymutual exclusioncritical sectionrecoverable mutual exclusionRME

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• RMR-efficient implementations of comparison primitives using read and write operations
• Recoverable mutual exclusion
• Recoverable mutual exclusion with abortability
• Extremal Combinatorics
• A fast, scalable mutual exclusion algorithm
• An improved lower bound for the time complexity of mutual exclusion
• A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
• Recoverable Mutual Exclusion Under System-Wide Failures
• Recoverable Mutual Exclusion in Sub-logarithmic Time
• An Adaptive Approach to Recoverable Mutual Exclusion
• Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives

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