An O(1)-barriers optimal RMRs mutual exclusion algorithm (extended abstract)

DOI10.1145/2484239.2484255MaRDI QIDQ5176098zbMATH OpenOpenAlexFDO

Authors Hagit Attiya, Danny Hendler, Smadar Levy

Publication date 2 March 2015

Published in Proceedings of the 2013 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

mutual exclusionshared memorytotal store ordering

Mathematics Subject Classification ID

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

Recommendations

• Randomized mutual exclusion in \(\mathcal{O}(\log N / \log \log N)\) RMRs
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• RMR-efficient randomized abortable mutual exclusion (extended abstract)
• The price of being adaptive
• Adaptive randomized mutual exclusion in sub-logarithmic expected time

Cited in

(4)

• A fast, scalable mutual exclusion algorithm
• The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes
• Constant RMR solutions to reader writer synchronization
• Closing the complexity gap between FCFS mutual exclusion and mutual exclusion

This page was built for publication: An \(O(1)\)-barriers optimal RMRs mutual exclusion algorithm (extended abstract)

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