Communication-efficient leader election and consensus with limited link synchrony

DOI10.1145/1011767.1011816zbMath1321.68098OpenAlexW2060265887MaRDI QIDQ5501513

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

distributed systemsfault toleranceasynchronous systemsconsensusleader electionsynchronous systemsfailure detectorpartially synchronous systems

Mathematics Subject Classification ID

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

Related Items (13)

The Theta-Model: achieving synchrony without clocks ⋮ On implementing omega in systems with weak reliability and synchrony assumptions ⋮ A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems ⋮ Partial synchrony based on set timeliness ⋮ Failure detectors encapsulate fairness ⋮ Self-stabilizing indulgent zero-degrading binary consensus ⋮ When consensus meets self-stabilization ⋮ Communication-optimal eventually perfect failure detection in partially synchronous systems ⋮ Stabilizing leader election in partial synchronous systems with crash failures ⋮ The asynchronous bounded-cycle model ⋮ A simple and communication-efficient omega algorithm in the crash-recovery model ⋮ Packet efficient implementation of the Omega failure detector ⋮ Implementing the Omega failure detector in the crash-recovery failure model

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