Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks

DOI10.1016/S0304-3975(98)00235-7zbMATH Open0933.68010MaRDI QIDQ1292422FDOQ1292422

Authors: Marcos Kawazoe Aguilera, Wei Chen, Sam Toueg 

Publication date: 21 June 1999

Published in: Theoretical Computer Science (Search for Journal in Brave)

Recommendations

• On Quiescent Reliable Communication
• Crash-Quiescent Failure Detection
• Unreliable failure detectors for reliable distributed systems
• Communication-efficient failure detection and consensus in omission environments
• The weakest failure detectors to solve quittable consensus and nonblocking atomic commit

zbMATH Keywords

consensusfailure detectorsreliable communicationpartitionable networksquiescent algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Unreliable failure detectors for reliable distributed systems
• Impossibility of distributed consensus with one faulty process
• The weakest failure detector for solving consensus

Cited In (5)

• Crash-Quiescent Failure Detection
• Gracefully degrading consensus and \(k\)-set agreement in directed dynamic networks
• On Quiescent Reliable Communication
• An eventually perfect failure detector for networks of arbitrary topology connected with ADD channels using time-to-live values
• Implementing \(\lozenge P\) with bounded messages on a network of ADD channels

This page was built for publication: Using the heartbeat failure detector for quiescent reliable communication and consensus in partitionable networks

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