Recoverable mutual exclusion

DOI10.1007/S00446-019-00364-0zbMATH Open1451.68045OpenAlexW2985470207MaRDI QIDQ2010612FDOQ2010612

Authors: Wojciech Golab, Aditya Ramaraju 

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

Recommendations

• Recoverable mutual exclusion (extended abstract)
• Recoverable mutual exclusion under system-wide failures
• Recoverable FCFS mutual exclusion with wait-free recovery
• Recoverable mutual exclusion in sub-logarithmic time
• Recoverable mutual exclusion with abortability

zbMATH Keywords

synchronizationconcurrencyfault tolerancerecoveryshared memorymutual exclusionmulti-core algorithmsdurable data structuresnon-volatile main memory

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Data structures (68P05) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed systems (68M14) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Cites Work

• Self-stabilizing systems in spite of distributed control
• Computing with faulty shared objects
• Title not available (Why is that?)
• A new solution of Dijkstra's concurrent programming problem
• Title not available (Why is that?)
• Bounds on shared memory for mutual exclusion
• Title not available (Why is that?)
• f -arrays
• An Ω ( n log n ) lower bound on the cost of mutual exclusion
• Randomized mutual exclusion with sub-logarithmic RMR-complexity
• The mutual exclusion problem
• The mutual exclusion problem
• Randomized Abortable Mutual Exclusion with Constant Amortized RMR Complexity on the CC Model
• A fast, scalable mutual exclusion algorithm
• Self-stabilization of wait-free shared memory objects
• Fault-tolerant wait-free shared objects
• Resilience of mutual exclusion algorithms to transient memory faults
• Shared-memory mutual exclusion: major research trends since 1986
• Arbitration without common modifiable variables
• A space- and time-efficient local-spin spin lock.
• RMR-efficient implementations of comparison primitives using read and write operations
• An improved lower bound for the time complexity of mutual exclusion
• A new fast-path mechanism for mutual exclusion
• A Recoverable Mutex Algorithm with Sub-logarithmic RMR on Both CC and DSM
• Recoverable Mutual Exclusion Under System-Wide Failures
• Recoverable Mutual Exclusion
• Recoverable Mutual Exclusion in Sub-logarithmic Time
• Mutual Exclusion with O(log^2 Log n) Amortized Work
• Recoverable FCFS mutual exclusion with wait-free recovery

Cited In (2)

• Recoverable FCFS mutual exclusion with wait-free recovery
• Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

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)