Fair mutual exclusion with unfair P and V operations

DOI10.1016/0020-0190(85)90041-9zbMath0593.68018OpenAlexW2069116943MaRDI QIDQ1076509

Alain J. Martin, Jerry R. Burch

Publication date: 1985

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

Full work available at URL: https://resolver.caltech.edu/CaltechCSTR:1984.5148-tr-84

zbMATH Keywords

fairnessmutual exclusioncritical sectionindividual starvationP and V operationssplit binary semaphore

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Related Items (2)

An efficient solution to the mutual exclusion problem using weak semaphores ⋮ Starvation-free mutual exclusion with semaphores

Cites Work

• Unnamed Item
• An axiomatic definition of synchronization primitives
• A starvation-free solution to the mutual exclusion problem
• Monitors

This page was built for publication: Fair mutual exclusion with unfair P and V operations