An efficient solution to the mutual exclusion problem using weak semaphores

DOI10.1016/0020-0190(87)90210-9MaRDI QIDQ1091125zbMATH OpenOpenAlexFDO

Authors Stuart A. Friedberg, Gary L. Peterson

Publication date 1987

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

Copyright license Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International

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)

Cites work

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

Cited in

(1)

• Computing with infinitely many processes

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

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