Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
From MaRDI portal
Recommendations
- Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
- Space-efficient FCFS group mutual exclusion
- SOFSEM 2005: Theory and Practice of Computer Science
- The \(k\)-bakery, local-spin \(k\)-exclusion using non-atomic reads and writes
Cites work
- A new solution of Dijkstra's concurrent programming problem
- A New Solution to Lamport's Concurrent Programming Problem Using Small Shared Variables
- A new solution to the critical section problem
- Concurrent programming: algorithms, principles, and foundations.
- Highly-fair bakery algorithm using symmetric tokens
- scientific article; zbMATH DE number 47171 (Why is no real title available?)
- scientific article; zbMATH DE number 2080925 (Why is no real title available?)
- Nonatomic dual bakery algorithm with bounded tokens
- Shared-memory mutual exclusion: major research trends since 1986
- The Black-White Bakery Algorithm and Related Bounded-Space, Adaptive, Local-Spinning and FIFO Algorithms
- The mutual exclusion problem
Cited in
(5)- Closing the Complexity Gap between FCFS Mutual Exclusion and Mutual Exclusion
- SOFSEM 2005: Theory and Practice of Computer Science
- scientific article; zbMATH DE number 7774267 (Why is no real title available?)
- Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
- Correctness and concurrent complexity of the black-white bakery algorithm
This page was built for publication: Simple, space-efficient, and fairness improved FCFS mutual exclusion algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q897371)
