Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

DOI10.1145/3212734.3212759MaRDI QIDQ5197664zbMATH OpenOpenAlexFDO

Authors Adam Alon, Adam Morrison

Publication date 19 September 2019

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

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

Mathematics Subject Classification ID

Distributed algorithms (68W15) Analysis of algorithms (68W40)

Recommendations

• Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model
• RMR-efficient randomized abortable mutual exclusion (extended abstract)
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• Adaptive randomized mutual exclusion in sub-logarithmic expected time
• Randomized mutual exclusion in \(\mathcal{O}(\log N / \log \log N)\) RMRs

Cited in

(10)

• Recoverable mutual exclusion with abortability
• Adaptive and efficient abortable mutual exclusion
• RMR-efficient randomized abortable mutual exclusion (extended abstract)
• Abortable Reader-Writer Locks Are No More Complex Than Abortable Mutex Locks
• An almost tight RMR lower bound for abortable test-and-set
• Constant Amortized RMR Abortable Mutex for CC and DSM
• Recoverable mutual exclusion in sub-logarithmic time
• Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• Recoverable, abortable, and adaptive mutual exclusion with sublogarithmic RMR complexity

This page was built for publication: Deterministic abortable mutual exclusion with sublogarithmic adaptive RMR complexity

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