Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

DOI10.1145/3583668.3594597MaRDI QIDQ6202227FDOQ6202227

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

concurrencyfault toleranceshared memorymutual exclusioncritical sectionrecoverable mutual exclusionRME

Mathematics Subject Classification ID

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

Cites Work

• Extremal Combinatorics
• Title not available (Why is that?)
• A fast, scalable mutual exclusion algorithm
• RMR-efficient implementations of comparison primitives using read and write operations
• An improved lower bound for the time complexity of mutual exclusion
• Recoverable 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
• Recoverable FCFS mutual exclusion with wait-free recovery
• Recoverable mutual exclusion with abortability
• 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

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