Constant RMR Recoverable Mutex under System-wide Crashes

by   Prasad Jayanti, et al.
Dartmouth College

We design two Recoverable Mutual Exclusion (RME) locks for the system-wide crash model. Our first algorithm requires only O(1) space per process, and achieves O(1) worst-case RMR complexity in the CC model. Our second algorithm enhances the first algorithm to achieve (the same) O(1) space per process and O(1) worst-case RMR complexity in both the CC and DSM models. Furthermore, both algorithms allow dynamically created threads of arbitrary names to join the protocol and access the locks. To our knowledge, these are the only RME locks to achieve worst-case O(1) RMR complexity assuming nothing more than standard hardware support. In light of Chan and Woelfel's Ω(log n / loglog n) worst-case RMR lower bound for RME in the individual crash model, our results show a separation between the system-wide crash and individual crash models in worst-case RMR complexity in both the CC and DSM models.


page 1

page 2

page 3

page 4


Beyond Worst-Case Analysis

In the worst-case analysis of algorithms, the overall performance of an ...

Worst Case Resistance Testing: A Nonresponse Bias Solution for Today's Behavioral Research Realities

This study proposes a method of nonresponse assessment based on meta-ana...

On the probabilistic continuous complexity conjecture

In this paper we prove the probabilistic continuous complexity conjectur...

Every Bit Counts in Consensus

Consensus enables n processes to agree on a common valid L-bit value, de...

Segre-Driven Radicality Testing

We present a probabilistic algorithm to test if a homogeneous polynomial...

Model Complexity-Accuracy Trade-off for a Convolutional Neural Network

Convolutional Neural Networks(CNN) has had a great success in the recent...

Matching calipers and the precision of index estimation

This paper characterizes the precision of index estimation as it carries...

Please sign up or login with your details

Forgot password? Click here to reset