Recoverable mutual exclusion
DOI10.1007/S00446-019-00364-0zbMath1451.68045OpenAlexW2985470207MaRDI QIDQ2010612
Aditya Ramaraju, Wojciech Golab
Publication date: 27 November 2019
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00446-019-00364-0
synchronizationfault toleranceconcurrencyshared memorymutual exclusionrecoverymulti-core algorithmsdurable data structuresnon-volatile main memory
Analysis of algorithms and problem complexity (68Q25) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Data structures (68P05) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Randomized mutual exclusion with sub-logarithmic RMR-complexity
- Self-stabilization of wait-free shared memory objects
- Arbitration without common modifiable variables
- Bounds on shared memory for mutual exclusion
- A space- and time-efficient local-spin spin lock.
- RMR-efficient implementations of comparison primitives using read and write operations
- Resilience of mutual exclusion algorithms to transient memory faults
- Fault-tolerant wait-free shared objects
- Self-stabilizing systems in spite of distributed control
- Computing with faulty shared objects
- A new solution of Dijkstra's concurrent programming problem
- A fast, scalable mutual exclusion algorithm
- A new fast-path mechanism for mutual exclusion
- An improved lower bound for the time complexity of mutual exclusion
- Shared-memory mutual exclusion: major research trends since 1986
- A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
- f -arrays
- An Ω ( n log n ) lower bound on the cost of mutual exclusion
- Recoverable Mutual Exclusion Under System-Wide Failures
- Recoverable Mutual Exclusion
- Recoverable Mutual Exclusion in Sub-logarithmic Time
- Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model
- Mutual Exclusion with O(log^2 Log n) Amortized Work
- The mutual exclusion problem
- The mutual exclusion problem
- Recoverable FCFS mutual exclusion with wait-free recovery
This page was built for publication: Recoverable mutual exclusion