The weakest failure detector to solve nonuniform consensus

DOI10.1007/S00446-006-0019-4zbMath1266.68211OpenAlexW2091544818MaRDI QIDQ1954210

Sam Toueg, Jonathan Eisler, Vassos Hadzilacos

Publication date: 20 June 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-006-0019-4

zbMATH Keywords

fault tolerancedistributed algorithmsconsensusfailure detectors

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (1)

On implementing omega in systems with weak reliability and synchrony assumptions

Cites Work

• Impossibility of distributed consensus with one faulty process
• Time, clocks, and the ordering of events in a distributed system
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Distributed Computing

This page was built for publication: The weakest failure detector to solve nonuniform consensus