An efficient solution to the mutual exclusion problem using weak semaphores

DOI10.1016/0020-0190(87)90210-9zbMath0622.68029OpenAlexW2089352481MaRDI QIDQ1091125

Gary L. Peterson, Stuart A. Friedberg

Publication date: 1987

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

Full work available at URL: https://doi.org/10.1016/0020-0190(87)90210-9

zbMATH Keywords

mutual exclusioncritical sectionsemaphore

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (1)

Computing with infinitely many processes

Cites Work

• Fair mutual exclusion with unfair P and V operations
• Myths about the mutual exclusion problem
• A starvation-free solution to the mutual exclusion problem
• Data Requirements for Implementation of N -Process Mutual Exclusion Using a Single Shared Variable
• Programming as a Discipline of Mathematical Nature

This page was built for publication: An efficient solution to the mutual exclusion problem using weak semaphores