Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives

DOI10.1145/3382734.3405736MaRDI QIDQ5855229zbMATH OpenOpenAlexFDO

Authors David Yu Cheng Chan, Philipp Woelfel

Publication date 15 March 2021

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

Full work available at URL https://doi.org/10.1145/3382734.3405736

zbMATH Keywords

asynchronous systemshared memoryfetch and incrementrecoverable mutual exclusion

Mathematics Subject Classification ID

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

Cited in

(4)

• Recoverable, abortable, and adaptive mutual exclusion with sublogarithmic RMR complexity
• Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion
• Recoverable mutual exclusion with abortability
• Adaptive and fair transformation for recoverable mutual exclusion

This page was built for publication: Recoverable Mutual Exclusion with Constant Amortized RMR Complexity from Standard Primitives

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