A mutual exclusion algorithm with optimally bounded bypasses

DOI10.1016/J.IPL.2005.05.015zbMath1181.68324OpenAlexW2055596870MaRDI QIDQ1044699

K. Alagarsamy

Publication date: 18 December 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2005.05.015

zbMATH Keywords

synchronizationconcurrencymutual exclusioncritical sectionread/write atomicitybypasses

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Related Items (2)

Queue based mutual exclusion with linearly bounded overtaking ⋮ A queue based mutual exclusion algorithm

Cites Work

• Unnamed Item
• Unnamed Item
• A more efficient generalization of Peterson's mutual exclusion algorithm
• Myths about the mutual exclusion problem
• Peterson's mutual exclusion algorithm revisited
• A simple group mutual \(l\)-exclusion algorithm.
• Shared-memory mutual exclusion: major research trends since 1986

This page was built for publication: A mutual exclusion algorithm with optimally bounded bypasses