Memory space requirements for self-stabilizing leader election protocols

DOI10.1145/301308.301358MaRDI QIDQ2942763zbMATH OpenOpenAlexFDO

Authors Maria Gradinariu, Colette Johnen, J. 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

decidabilityleader electionmemory space requirementmutual exclusionself-stabilization

Mathematics Subject Classification ID

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

Cited in

(10)

• A space-efficient self-stabilizing algorithm for measuring the size of ring networks
• Compact deterministic self-stabilizing leader election on a ring: the exponential advantage of being talkative
• 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
• A Multi-level Refinement Approach for Structural Synthesis of Optimal Probabilistic Models
• Randomized dining philosophers without fairness assumption
• Communication efficient self-stabilizing leader election
• Stabilizing leader election in partial synchronous systems with crash failures
• Quantitative analysis with the probabilistic model checker PRISM

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942763)