Randomized mutual exclusion with sub-logarithmic RMR-complexity

DOI10.1007/s00446-011-0128-6zbMath1231.68081OpenAlexW1984883054MaRDI QIDQ661045

Danny Hendler, Philipp Woelfel

Publication date: 6 February 2012

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-011-0128-6

zbMATH Keywords

randomizationmutual exclusionremote memory reference (RMR)strong adversary

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Distributed systems (68M14) Randomized algorithms (68W20)

Related Items (4)

A time complexity lower bound for adaptive mutual exclusion ⋮ Recoverable mutual exclusion ⋮ Unnamed Item ⋮ Allocate-On-Use Space Complexity of Shared-Memory Algorithms

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
• Nonatomic mutual exclusion with local spinning
• Adaptive and efficient abortable mutual exclusion
• Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
• Linearizable implementations do not suffice for randomized distributed computation
• SOFSEM 2005: Theory and Practice of Computer Science

This page was built for publication: Randomized mutual exclusion with sub-logarithmic RMR-complexity