Adaptive solutions to the mutual exclusion problem
From MaRDI portal
Recommendations
Cites work
- A new solution of Dijkstra's concurrent programming problem
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- Contention in shared memory algorithms
- scientific article; zbMATH DE number 1003297 (Why is no real title available?)
- scientific article; zbMATH DE number 194539 (Why is no real title available?)
- Improving fast mutual exclusion
- Speeding Lamport's fast mutual exclusion algorithm
Cited in
(15)- On the cost of uniform protocols whose memory consumption is adaptive to interval contention
- Nonatomic mutual exclusion with local spinning
- A visit to mutual exclusion in seven dates
- Mutual exclusion on a hypercube
- Adaptive distributed mutual exclusion by dynamic topology switching
- Computing with infinitely many processes
- The mutual exclusion problem: part II---Statement and solutions
- Using local-spin \(k\)-exclusion algorithms to improve wait-free object implementations
- A new fast-path mechanism for mutual exclusion
- An adaptive collect algorithm with applications
- Adaptive and efficient mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
- Shared-memory mutual exclusion: major research trends since 1986
- Adaptive and efficient mutual exclusion (extended abstract)
- The mutual exclusion problem
This page was built for publication: Adaptive solutions to the mutual exclusion problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136975)