A more efficient generalization of Peterson's mutual exclusion algorithm

DOI10.1016/0020-0190(90)90048-3zbMATH Open0706.68014OpenAlexW2071009528MaRDI QIDQ918655FDOQ918655

Kenneth Block, Tai-Kuo Woo

Publication date: 1990

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

Full work available at URL: https://doi.org/10.1016/0020-0190(90)90048-3

zbMATH Keywords

concurrency controlmutual exclusionconcurrent programmingcritical section

Mathematics Subject Classification ID

General topics in the theory of software (68N01) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10) Network design and communication in computer systems (68M10)

Cites Work

• Myths about the mutual exclusion problem
• A new solution of Dijkstra's concurrent programming problem

Cited In (6)

• Queue based mutual exclusion with linearly bounded overtaking
• A queue based mutual exclusion algorithm
• A mutual exclusion algorithm with optimally bounded bypasses
• Improving fast mutual exclusion
• An improved lower bound for the time complexity of mutual exclusion
• ZB 2005: Formal Specification and Development in Z and B

This page was built for publication: A more efficient generalization of Peterson's mutual exclusion algorithm

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