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

by   Prasad Jayanti, et al.

In light of recent advances in non-volatile main memory technology, Golab and Ramaraju reformulated the traditional mutex problem into the novel Recoverable Mutual Exclusion (RME) problem. In the best known solution for RME, due to Golab and Hendler from PODC 2017, a process incurs at most O( n/ n) remote memory references (RMRs) per passage, where a passage is an interval from when a process enters the Try section to when it subsequently returns to Remainder. Their algorithm, however, guarantees this bound only for cache-coherent (CC) multiprocessors, leaving open the question of whether a similar bound is possible for distributed shared memory (DSM) multiprocessors. We answer this question affirmatively by designing an algorithm that satisfies the same complexity bound as Golab and Hendler's for both CC and DSM multiprocessors. Our algorithm has some additional advantages over Golab and Hendler's: (i) its Exit section is wait-free, (ii) it uses only the Fetch-and-Store instruction, and (iii) on a CC machine our algorithm needs each process to have a cache of only O(1) words, while their algorithm needs O(n) words.


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...

An Adaptive Approach to Recoverable Mutual Exlcusion

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

Two Mutual Exclusion Algorithms for Shared Memory

In this paper, we introduce two algorithms that solve the mutual exclusi...

Recoverable Mutual Exclusion with Abortability

Recent advances in non-volatile main memory (NVRAM) technology have spur...

Adaptive and Fair Transformation for Recoverable Mutual Exclusion

Mutual exclusion is one of the most commonly used techniques to handle c...

An Almost Tight RMR Lower Bound for Abortable Test-And-Set

We prove a lower bound of Omega(log n/loglog n) for the remote memory re...

Neighborhood Mutual Remainder: Self-Stabilizing Implementation of Look-Compute-Move Robots (Extended Abstract)

Local mutual exclusion guarantees that no two neighboring processes ente...

Please sign up or login with your details

Forgot password? Click here to reset