Recoverable mutual exclusion
From MaRDI portal
Publication:2010612
Recommendations
Cites work
- scientific article; zbMATH DE number 5485533 (Why is no real title available?)
- scientific article; zbMATH DE number 4082934 (Why is no real title available?)
- scientific article; zbMATH DE number 482761 (Why is no real title available?)
- A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
- A fast, scalable mutual exclusion algorithm
- A new fast-path mechanism for mutual exclusion
- A new solution of Dijkstra's concurrent programming problem
- A space- and time-efficient local-spin spin lock.
- An \({\Omega}(n\log n)\) lower bound on the cost of mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
- Arbitration without common modifiable variables
- Bounds on shared memory for mutual exclusion
- Computing with faulty shared objects
- F-arrays, implementation and applications
- Fault-tolerant wait-free shared objects
- Mutual Exclusion with O(log^2 Log n) Amortized Work
- RMR-efficient implementations of comparison primitives using read and write operations
- Randomized abortable mutual exclusion with constant amortized RMR complexity on the CC model
- Randomized mutual exclusion with sub-logarithmic RMR-complexity
- Recoverable FCFS mutual exclusion with wait-free recovery
- Recoverable mutual exclusion (extended abstract)
- Recoverable mutual exclusion in sub-logarithmic time
- Recoverable mutual exclusion under system-wide failures
- Resilience of mutual exclusion algorithms to transient memory faults
- Self-stabilization of wait-free shared memory objects
- Self-stabilizing systems in spite of distributed control
- Shared-memory mutual exclusion: major research trends since 1986
- The mutual exclusion problem
- The mutual exclusion problem
Cited in
(4)
This page was built for publication: Recoverable mutual exclusion
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2010612)
