Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2014

Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM

Abstract

In this paper we settle an open question by determining the remote memory reference (RMR) complexity of randomized mutual exclusion, on the distributed shared memory model (DSM) with atomic registers, in a weak but natural (and stronger than oblivious) adversary model. In particular, we present a mutual exclusion algorithm that has constant expected amortized RMR complexity and is deterministically deadlock free. Prior to this work, no randomized algorithm with o(log n/ log log n) RMR complexity was known for the DSM model. Our algorithm is fairly simple, and compares favorably with one by Bender and Gilbert (FOCS 2011) for the CC model, which has expected amortized RMR complexity O(log^2 log n) and provides only probabilistic deadlock freedom.
Fichier principal
Vignette du fichier
focs14_mutexobl.pdf (352.32 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-01097144 , version 1 (19-12-2014)

Identifiers

  • HAL Id : hal-01097144 , version 1

Cite

George Giakkoupis, Philipp Woelfel. Randomized Mutual Exclusion with Constant Amortized RMR Complexity on the DSM. 55th IEEE Symposium on Foundations of Computer Science (FOCS), Oct 2014, Philadelphia, PA, United States. ⟨hal-01097144⟩
169 View
194 Download

Share

Gmail Facebook X LinkedIn More