A starvation-free solution to the mutual exclusion problem
From MaRDI portal
Publication:1253914
DOI10.1016/0020-0190(79)90147-9zbMath0397.68036OpenAlexW2057870640MaRDI QIDQ1253914
Publication date: 1979
Published in: Information Processing Letters (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0020-0190(79)90147-9
Correctness Of An AlgorithmCritical SectionScheduling AlgorithmStarvation-Free Solution to the Mutual Exclusion Problem
Performance evaluation, queueing, and scheduling in the context of computer systems (68M20) Theory of operating systems (68N25) Algorithms in computer science (68W99)
Related Items
Fair mutual exclusion with unfair P and V operations, Comments on Morris's starvation-free solution to the mutual exclusion problem, An efficient solution to the mutual exclusion problem using weak semaphores, Highly-fair bakery algorithm using symmetric tokens, Starvation-free mutual exclusion with semaphores, Gurevich-Harrington's games defined by finite automata, Queue based mutual exclusion with linearly bounded overtaking, Extension of Gurevich-Harrington's restricted memory determinacy theorem: A criterion for the winning player and an explicit class of winning strategies, An approach to automating the verification of compact parallel coordination programs. I
Cites Work
