Queue based mutual exclusion with linearly bounded overtaking
From MaRDI portal
Publication:532419
DOI10.1016/j.scico.2010.11.002zbMath1217.68137OpenAlexW2083112208MaRDI QIDQ532419
Wim H. Hesselink, Alex A. Aravind
Publication date: 4 May 2011
Published in: Science of Computer Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.scico.2010.11.002
Specification and verification (program logics, model checking, etc.) (68Q60) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The existence of refinement mappings
- A more efficient generalization of Peterson's mutual exclusion algorithm
- A queue based mutual exclusion algorithm
- A mutual exclusion algorithm with optimally bounded bypasses
- Myths about the mutual exclusion problem
- An axiomatic proof technique for parallel programs
- A starvation-free solution to the mutual exclusion problem
- A new solution of Dijkstra's concurrent programming problem
This page was built for publication: Queue based mutual exclusion with linearly bounded overtaking