# A tight RMR lower bound for randomized mutual exclusion

1 ASAP - As Scalable As Possible: foundations of large scale dynamic distributed systems
IRISA-D1 - SYSTÈMES LARGE ÉCHELLE, Inria Rennes – Bretagne Atlantique
Abstract : The Cache Coherent (CC) and the Distributed Shared Memory (DSM) models are standard shared memory models, and the Remote Memory Reference (RMR) complexity is considered to accurately predict the actual performance of mutual exclusion algorithms in shared memory systems. In this paper we prove a tight lower bound for the RMR complexity of deadlock-free randomized mutual exclusion algorithms in both the CC and the DSM model with atomic registers and compare\&swap objects and an adaptive adversary. Our lower bound establishes that an adaptive adversary can schedule $n$ processes in such a way that each enters the critical section once, and the total number of RMRs is $\Omega(n \log n/\log\log n)$ in expectation. This matches an upper bound of Hendler and Woelfel (2011).
Document type :
Conference papers

Cited literature [25 references]

https://hal.inria.fr/hal-00722940
Contributor : George Giakkoupis <>
Submitted on : Monday, August 6, 2012 - 4:55:31 PM
Last modification on : Wednesday, June 16, 2021 - 3:41:16 AM
Long-term archiving on: : Wednesday, November 7, 2012 - 3:22:42 AM

### File

stoc12_mutex.pdf
Files produced by the author(s)

### Identifiers

• HAL Id : hal-00722940, version 1

### Citation

George Giakkoupis, Philipp Woelfel. A tight RMR lower bound for randomized mutual exclusion. STOC - 44th ACM Symposium on Theory of Computing, May 2012, New York, United States. ⟨hal-00722940⟩

Record views