ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2012.03140
25
11

Recoverable Mutual Exclusion with Abortability

5 December 2020
P. Jayanti
Anup Joshi
ArXiv (abs)PDFHTML
Abstract

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 \cite{jayanti:rmeabort}, 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))O(\min(k, \log n))O(min(k,logn)) RMRs in a passage and O(f+min⁡(k,log⁡n))O(f+ \min(k, \log n))O(f+min(k,logn)) RMRs in an attempt, where nnn is the number of processes that the algorithm is designed for, kkk is the point contention of the passage or the attempt, and fff is the number of times that ppp crashes during the attempt. On a Strict CC multiprocessor, the passage and attempt complexities are O(n)O(n)O(n) and O(f+n)O(f+n)O(f+n). Attiya et al. proved that, with any mutual exclusion algorithm, a process incurs at least Ω(log⁡n)\Omega(\log n)Ω(logn) RMRs in a passage, if the algorithm uses only the read, write, and CAS operations \cite{Attiya:lbound}. This lower bound implies that the worst-case RMR complexity of our algorithm is optimal for the DSM and Relaxed CC multiprocessors.

View on arXiv
Comments on this paper