Randomized mutual exclusion with sub-logarithmic RMR-complexity

Danny Hendler, Philipp Woelfel

Research output: Contribution to journalArticlepeer-review

18 Scopus citations

Abstract

Mutual exclusion is a fundamental distributed coordination problem. Shared-memory mutual exclusion research focuses on local-spin algorithms and uses the remote memory references (RMRs) metric. Attiya, Hendler, and Woelfel (40th STOC, 2008) established an Ω(log N) lower bound on the number of RMRs incurred by processes as they enter and exit the critical section, where N is the number of processes in the system. This matches the upper bound of Yang and Anderson (Distrib. Comput. 9(1):51-60, 1995). The upper and lower bounds apply for algorithms that only use read and write operations. The lower bound of Attiya et al.; however, only holds for deterministic algorithms. The question of whether randomized mutual exclusion algorithms, using reads and writes only, can achieve sub-logarithmic expected RMR complexity remained open. We answer this question in the affirmative by presenting starvation-free randomized mutual exclusion algorithms for the cache coherent (CC) and the distributed shared memory (DSM) model that have sub-logarithmic expected RMR complexity against the strong adversary. More specifically, each process incurs an expected number of O(log N / log log N) RMRs per passage through the entry and exit sections, while in the worst case the number of RMRs is O(log N).

Original languageEnglish
Pages (from-to)3-19
Number of pages17
JournalDistributed Computing
Volume24
Issue number1
DOIs
StatePublished - 1 Jan 2011

Keywords

  • Mutual exclusion
  • RMRs
  • Randomization
  • Remote memory references
  • Strong adversary

Fingerprint

Dive into the research topics of 'Randomized mutual exclusion with sub-logarithmic RMR-complexity'. Together they form a unique fingerprint.

Cite this