Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2023

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion

Abstract

We present tradeoffs between RMR complexity and memory word size for recoverable mutual exclusion (RME) algorithms using arbitrary synchronization primitives. Assuming that each memory location stores $w$ bits, we show that $n$-process mutual exclusion has an RMR complexity of at least $\Omega\left(\min\left\{\log_w n,\log n/\log\log n\right\}\right)$ on the DSM and the CC model. For $w=(\log n)^{\Omega(1)}$, our lower bound asymptotically matches an upper bound by Katzan and Morrison (2020), whose RME mutual exclusion algorithm employs $w$-bit fetch-and-add operations. Our lower bound is the first one that does not restrict the type of atomic operations that can be executed on a memory location.
Fichier principal
Vignette du fichier
general-rme-space-lower-bound.pdf (675.9 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-04395095 , version 1 (15-01-2024)

Licence

Attribution

Identifiers

Cite

David Yu Cheng Chan, George Giakkoupis, Philipp Woelfel. Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion. PODC 2023 - ACM Symposium on Principles of Distributed Computing, Jun 2023, Orlando (FL), United States. pp.79-89, ⟨10.1145/3583668.3594597⟩. ⟨hal-04395095⟩
13 View
5 Download

Altmetric

Share

Gmail Facebook X LinkedIn More