The weakest failure detector for eventual consistency

DOI10.1007/s00446-016-0292-9zbMath1451.68042OpenAlexW2570591818MaRDI QIDQ2010607

Petr Kuznetsov, Franck Petit, Rachid Guerraoui, Pierre Sens, Swan Dubois

Publication date: 27 November 2019

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

Full work available at URL: https://infoscience.epfl.ch/record/213733/files/the_weakest_fail_p375-dubois.pdf

zbMATH Keywords

consensuseventual consistencyfailure detectorstotal-order broadcast

Mathematics Subject Classification ID

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

Related Items (1)

Perfect failure detection with very few bits

Uses Software

• Cassandra
• Bigtable
• Dynamo

Cites Work

• From binary consensus to multivalued consensus in asynchronous message-passing systems
• Eventually-serializable data services
• Atomic broadcast: From simple message diffusion to Byzantine agreement
• Lower bounds for asynchronous consensus
• When consensus meets self-stabilization
• The Weakest Failure Detector for Eventual Consistency
• The failure detector abstraction
• Every problem has a weakest failure detector
• Coordinated consensus in dynamic networks
• Tight failure detection bounds on atomic object implementations
• Impossibility of distributed consensus with one faulty process
• Proving the Correctness of Multiprocess Programs
• Unreliable failure detectors for reliable distributed systems
• The weakest failure detector for solving consensus
• Calculs approchés de la borne inférieure de valeurs réparties
• The Weakest Failure Detectors to Solve Quittable Consensus and Nonblocking Atomic Commit
• Eventually linearizable shared objects

This page was built for publication: The weakest failure detector for eventual consistency