Communication-efficient leader election and consensus with limited link synchrony

DOI10.1145/1011767.1011816MaRDI QIDQ5501513zbMATH OpenOpenAlexFDO

Authors Carole Delporte-Gallet, Hugues Fauconnier, Sam Toueg, Marcos Kawazoe Aguilera

Publication date 3 August 2015

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

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

zbMATH Keywords

asynchronous systemsconsensusdistributed systemsfailure detectorfault toleranceleader electionpartially synchronous systemssynchronous systems

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Communication networks in operations research (90B18)

Recommendations

• Communication efficient self-stabilizing leader election
• scientific article; zbMATH DE number 6313182
• scientific article; zbMATH DE number 88976
• scientific article; zbMATH DE number 7774278
• Optimal asynchronous agreement and leader election algorithm for complete networks with Byzantine faulty links
• scientific article; zbMATH DE number 1759418
• Compact self-stabilizing leader election for general networks
• Near-Optimal Time–Energy Tradeoffs for Deterministic Leader Election

Cited in

(21)

• Implementing the Omega failure detector in the crash-recovery failure model
• Partial synchrony based on set timeliness
• Failure detectors encapsulate fairness
• When consensus meets self-stabilization
• The Theta-Model: achieving synchrony without clocks
• On implementing omega in systems with weak reliability and synchrony assumptions
• How to Solve Consensus in the Smallest Window of Synchrony
• Impossibility Results and Lower Bounds for Consensus under Link Failures
• scientific article; zbMATH DE number 88976 (Why is no real title available?)
• scientific article; zbMATH DE number 2006647 (Why is no real title available?)
• Communication-optimal eventually perfect failure detection in partially synchronous systems
• scientific article; zbMATH DE number 6313182 (Why is no real title available?)
• Distributed Computing
• From an intermittent rotating star to a leader
• Self-stabilizing indulgent zero-degrading binary consensus
• Stabilizing leader election in partial synchronous systems with crash failures
• Topological characterization of consensus in distributed systems
• The asynchronous bounded-cycle model
• Synchronous consensus under hybrid process and link failures
• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems
• A simple and communication-efficient omega algorithm in the crash-recovery model

This page was built for publication: Communication-efficient leader election and consensus with limited link synchrony

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