The weakest failure detector for eventual consistency

DOI10.1007/S00446-016-0292-9zbMATH Open1451.68042OpenAlexW2570591818MaRDI QIDQ2010607FDOQ2010607

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

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

Cites Work

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

Cited In (2)

• The weakest failure detector for solving consensus
• Perfect failure detection with very few bits

Uses Software

• Cassandra
• Bigtable
• Dynamo

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

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