Tight RMR lower bounds for mutual exclusion and other problems

Authors:
Hagit Attiya;Danny Hendler;Philipp Woelfel
Affiliations:
Technion, Haifa, Israel;Ben-Gurion University, Beer-Sheva, Israel;University of Calgary, Calgary, Canada
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 2
Cited 0

An Ω (n log n) lower bound on the cost of mutual exclusion

Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing
Tight RMR lower bounds for mutual exclusion and other problems

STOC '08 Proceedings of the fortieth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We investigate the remote memory references (RMRs) complexity of deterministic processes that communicate by reading and writing shared memory in asynchronous cache-coherent and distributed shared-memory multiprocessors. We define a class of algorithms that we call order encoding. By applying information-theoretic arguments, we prove that every order-encoding algorithm, shared by n processes, has an execution that incurs Ω(n log n) RMRs. This yields the same lower bound for the mutual exclusion, bounded counter and store/collect synchronization problems.