Memory space requirements for self-stabilizing leader election protocols

DOI10.1145/301308.301358zbMath1321.68063OpenAlexW2043235094MaRDI QIDQ2942763

Maria Gradinariu, Colette Johnen, Joffroy Beauquier

Publication date: 11 September 2015

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

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

zbMATH Keywords

decidabilitymutual exclusionself-stabilizationleader electionmemory space requirement

Mathematics Subject Classification ID

Distributed systems (68M14) Network protocols (68M12) Distributed algorithms (68W15)

Related Items (8)

Probabilistic verification of Herman's self-stabilisation algorithm ⋮ Randomized self-stabilizing and space optimal leader election under arbitrary scheduler on rings ⋮ Constant-Space Localized Byzantine Consensus ⋮ Randomized Dining Philosophers without Fairness Assumption ⋮ Stabilizing leader election in partial synchronous systems with crash failures ⋮ Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative ⋮ A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models ⋮ A space-efficient self-stabilizing algorithm for measuring the size of ring networks

This page was built for publication: Memory space requirements for self-stabilizing leader election protocols