Skip to Main content Skip to Navigation
Conference papers

A tight RMR lower bound for randomized mutual exclusion

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).
Complete list of metadata

Cited literature [25 references]  Display  Hide  Download
Contributor : George Giakkoupis Connect in order to contact the contributor
Submitted on : Monday, August 6, 2012 - 4:55:31 PM
Last modification on : Wednesday, February 2, 2022 - 3:50:55 PM
Long-term archiving on: : Wednesday, November 7, 2012 - 3:22:42 AM


Files produced by the author(s)


  • HAL Id : hal-00722940, version 1


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


Files downloads