Speeding Lamport's fast mutual exclusion algorithm
From MaRDI portal
Publication:1209340
DOI10.1016/0020-0190(93)90015-2zbMath0796.68018OpenAlexW2024412809MaRDI QIDQ1209340
Gadi Taubenfeld, Michael Merritt
Publication date: 16 May 1993
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(93)90015-2
Analysis of algorithms and problem complexity (68Q25) Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15)
Related Items
A visit to mutual exclusion in seven dates, An improved lower bound for the time complexity of mutual exclusion, Computing with infinitely many processes, A time complexity lower bound for adaptive mutual exclusion, Adaptive mutual exclusion with local spinning, Adaptive solutions to the mutual exclusion problem, A new fast-path mechanism for mutual exclusion, Long lived adaptive splitter and applications, Adaptive and efficient mutual exclusion, Shared-memory mutual exclusion: major research trends since 1986, On the cost of uniform protocols whose memory consumption is adaptive to interval contention
