A queue based mutual exclusion algorithm

DOI10.1007/S00236-008-0086-ZMaRDI QIDQ1006897zbMATH OpenOpenAlexFDO

Authors Alex A. Aravind, W. H. Hesselink

Publication date 26 March 2009

Published in Acta Informatica (Search for Journal in Brave)

Full work available at URL https://pure.rug.nl/ws/files/2673455/2009ActaInfAravind.pdf

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Specification and verification (program logics, model checking, etc.) (68Q60) Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85)

Recommendations

• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
• Queue based mutual exclusion with linearly bounded overtaking
• Mutual exclusion algorithms with constant RMR complexity and wait-free exit code
• Nonatomic dual bakery algorithm with bounded tokens
• scientific article; zbMATH DE number 2089981

Cites work

• scientific article; zbMATH DE number 3943003 (Why is no real title available?)
• scientific article; zbMATH DE number 4082934 (Why is no real title available?)
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• A criterion for atomicity revisited
• A more efficient generalization of Peterson's mutual exclusion algorithm
• A mutual exclusion algorithm with optimally bounded bypasses
• A new solution of Dijkstra's concurrent programming problem
• An assertional proof for a construction of an atomic variable
• Myths about the mutual exclusion problem
• On interprocess communication. I: Basic formalism

Cited in

(11)

• Starvation-free mutual exclusion with semaphores
• Verifying a simplification of mutual exclusion by Lycklama-Hadzilacos
• Nonatomic dual bakery algorithm with bounded tokens
• Simulation refinement for concurrency verification
• Analysing mutual exclusion using process algebra with signals
• scientific article; zbMATH DE number 1696665 (Why is no real title available?)
• Mutual exclusion as a matter of priority
• Tournaments for mutual exclusion: verification and concurrent complexity
• On the correctness of Goscinski's algorithm
• Mutual exclusion scheduling
• Queue based mutual exclusion with linearly bounded overtaking

Describes a project that uses

Uses Software

• SPIN
• PVS
• UNITY

This page was built for publication: A queue based mutual exclusion algorithm

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