Speeding Lamport's fast mutual exclusion algorithm

DOI10.1016/0020-0190(93)90015-2MaRDI QIDQ1209340zbMATH OpenOpenAlexFDO

Authors Michael Merritt, Gadi Taubenfeld

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

zbMATH Keywords

concurrencymutual exclusion algorithm

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Analysis of algorithms and problem complexity (68Q25) Distributed algorithms (68W15)

Recommendations

• A fast, scalable mutual exclusion algorithm
• scientific article; zbMATH DE number 2006660
• A new fast-path mechanism for mutual exclusion
• Improving fast mutual exclusion
• scientific article; zbMATH DE number 2080925

Cited in

(11)

• On the cost of uniform protocols whose memory consumption is adaptive to interval contention
• Adaptive mutual exclusion with local spinning
• A visit to mutual exclusion in seven dates
• Computing with infinitely many processes
• A time complexity lower bound for adaptive mutual exclusion
• 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
• An improved lower bound for the time complexity of mutual exclusion
• Shared-memory mutual exclusion: major research trends since 1986

This page was built for publication: Speeding Lamport's fast mutual exclusion algorithm

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