A fine-grained solution to the mutual exclusion problem
From MaRDI portal
Recommendations
Cites work
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- Atomic semantics of nonatomic programs
- scientific article; zbMATH DE number 3574936 (Why is no real title available?)
- Myths about the mutual exclusion problem
- On interprocess communication. I: Basic formalism
- The mutual exclusion problem
Cited in
(13)- Mutual exclusion as a matter of priority
- Nonatomic mutual exclusion with local spinning
- Adaptive mutual exclusion with local spinning
- Introducing mutual exclusion in Esterel
- Mutual Exclusion by Interpolation
- The mutual exclusion problem: part II---Statement and solutions
- A fast, scalable mutual exclusion algorithm
- Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
- Improving fast mutual exclusion
- The mutual exclusion problem
- Just verification of mutual exclusion algorithms
- On the notions of bounded bypass, and how to make any deadlock-free MUTEX protocol satisfy one of them
- Nonatomic dual bakery algorithm with bounded tokens
This page was built for publication: A fine-grained solution to the mutual exclusion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1323338)