A simple local-spin group mutual exclusion algorithm

DOI10.1145/301308.301319MaRDI QIDQ2942749zbMATH OpenOpenAlexFDO

Authors Patrick Keane, Mark Moir

Publication date 11 September 2015

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

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

Mathematics Subject Classification ID

Distributed systems (68M14) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)

Cited in

(9)

• Space-efficient FCFS group mutual exclusion
• Group mutual exclusion in linear time and space
• A simple group mutual \(l\)-exclusion algorithm.
• A visit to mutual exclusion in seven dates
• On quorum systems for group resources allocation
• A time complexity lower bound for adaptive mutual exclusion
• The congenial talking philosophers problem in computer networks
• Shared-memory mutual exclusion: major research trends since 1986
• Real-time multiprocessor locks with nesting: optimizing the common case

This page was built for publication: A simple local-spin group mutual exclusion algorithm

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