Recoverable Mutual Exclusion with Abortability

by   Prasad Jayanti, et al.

Recent advances in non-volatile main memory (NVRAM) technology have spurred research on designing algorithms that are resilient to process crashes. This paper is a fuller version of our conference paper <cit.>, which presents the first Recoverable Mutual Exclusion (RME) algorithm that supports abortability. Our algorithm uses only the read, write, and CAS operations, which are commonly supported by multiprocessors. It satisfies FCFS and other standard properties. Our algorithm is also adaptive. On DSM and Relaxed-CC multiprocessors, a process incurs O(min(k, log n)) RMRs in a passage and O(f+ min(k, log n)) RMRs in an attempt, where n is the number of processes that the algorithm is designed for, k is the point contention of the passage or the attempt, and f is the number of times that p crashes during the attempt. On a Strict CC multiprocessor, the passage and attempt complexities are O(n) and O(f+n). Attiya et al. proved that, with any mutual exclusion algorithm, a process incurs at least Ω(log n) RMRs in a passage, if the algorithm uses only the read, write, and CAS operations <cit.>. This lower bound implies that the worst-case RMR complexity of our algorithm is optimal for the DSM and Relaxed CC multiprocessors.


page 1

page 2

page 3

page 4


Recoverable, Abortable, and Adaptive Mutual Exclusion with Sublogarithmic RMR Complexity

We present the first recoverable mutual exclusion (RME) algorithm that i...

An Adaptive Approach to Recoverable Mutual Exlcusion

Mutual exclusion (ME) is one of the most commonly used techniques to han...

Generalized Wake-Up: Amortized Shared Memory Lower Bounds for Linearizable Data Structures

In this work, we define the generalized wake-up problem, GWU(s), for a s...

Tight Lower Bounds for the RMR Complexity of Recoverable Mutual Exclusion

We present a tight RMR complexity lower bound for the recoverable mutual...

Constant Amortized RMR Complexity Deterministic Abortable Mutual Exclusion Algorithm for CC and DSM Models

The abortable mutual exclusion problem was introduced by Scott and Scher...

Recoverable Mutual Exclusion with Sub-logarithmic RMR Complexity on CC and DSM machines

In light of recent advances in non-volatile main memory technology, Gola...

Memory Reclamation for Recoverable Mutual Exclusion

Mutual exclusion (ME) is a commonly used technique to handle conflicts i...

Please sign up or login with your details

Forgot password? Click here to reset