An O (1) RMRs leader election algorithm

DOI10.1145/1146381.1146417zbMath1314.68376OpenAlexW2010898455MaRDI QIDQ5177285

Philipp Woelfel, Wojciech Golab, Danny Hendler

Publication date: 10 March 2015

Published in: Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1146381.1146417

zbMATH Keywords

shared memorymutual exclusionleader electionremote memory referencestest-and-set

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed systems (68M14) Distributed algorithms (68W15)

This page was built for publication: An O (1) RMRs leader election algorithm