A simple local-spin group mutual exclusion algorithm
From MaRDI portal
Publication:2942749
DOI10.1145/301308.301319zbMath1321.68474OpenAlexW2041593340MaRDI QIDQ2942749
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
Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15)
Related Items (9)
A visit to mutual exclusion in seven dates ⋮ On quorum systems for group resources allocation ⋮ Group mutual exclusion in linear time and space ⋮ 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 ⋮ Space-efficient FCFS group mutual exclusion ⋮ Real-time multiprocessor locks with nesting: optimizing the common case ⋮ A simple group mutual \(l\)-exclusion algorithm.
This page was built for publication: A simple local-spin group mutual exclusion algorithm
