An $O(1)$ RMRs Leader Election Algorithm

DOI10.1137/070686445zbMath1213.68124OpenAlexW2076575129MaRDI QIDQ5390576

Philipp Woelfel, Danny Hendler, Wojciech Golab

Publication date: 4 April 2011

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1137/070686445

zbMATH Keywords

synchronizationdistributed shared memorymultiprocessorleader electionremote memory referencestest-and-setcache-coherent shared memory

Mathematics Subject Classification ID

Distributed systems (68M14) Distributed algorithms (68W15)

Related Items (6)

Unnamed Item ⋮ RMR-efficient implementations of comparison primitives using read and write operations ⋮ A time complexity lower bound for adaptive mutual exclusion ⋮ Efficient randomized test-and-set implementations ⋮ Unnamed Item ⋮ Sub-logarithmic Test-and-Set against a Weak Adversary

This page was built for publication: An $O(1)$ RMRs Leader Election Algorithm