Closing the complexity gap between mutual exclusion and FCFS mutual exclusion

Authors:
Robert Danek;Wojciech Golab
Affiliations:
University of Toronto, Toronto, ON, Canada;University of Toronto, Toronto, ON, Canada
Venue:
Proceedings of the twenty-seventh ACM symposium on Principles of distributed computing
Year:
2008

Citing 2
Cited 1

Shared-memory mutual exclusion: major research trends since 1986

Distributed Computing - Papers in celebration of the 20th anniversary of PODC
Tight RMR lower bounds for mutual exclusion and other problems

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

RMR-efficient randomized abortable mutual exclusion

DISC'12 Proceedings of the 26th international conference on Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the worst-case remote memory reference (RMR) complexity of first-come-first-served (FCFS) mutual exclusion (ME) algorithms for N asynchronous reliable processes that communicate only by reading and writing shared memory. We exhibit an upper bound of O(log N) RMRs for FCFS ME, which is tight, improves on prior results, and matches a lower bound for ME (with or without FCFS).