Failure Detection and Randomization: A Hybrid Approach to Solve Consensus

DOI10.1137/S0097539796312915MaRDI QIDQ4229413zbMATH OpenFDO

Authors Sam Toueg, Marcos Kawazoe Aguilera

Publication date 22 February 1999

Published in SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/S0097539796312915

zbMATH Keywords

agreement problemalgorithmsasynchronous systemsByzantine generals' problemconsensus problemcrash failuresfailure detectionfault-tolerancemessage passingprocessor failuresrandomized algorithmsreliability

Mathematics Subject Classification ID

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

Recommendations

• A simple and fast asynchronous consensus protocol based on a weak failure detector
• Randomized protocols for asynchronous consensus
• Unreliable failure detectors for reliable distributed systems
• Tight bounds for asynchronous randomized consensus
• Randomized consensus in expected O(n n) individual work

Cited in

(14)

• The weakest failure detector to solve nonuniform consensus
• A Paxos based algorithm to minimize the overhead of process recovery in consensus
• Randomization Can Be a Healer: Consensus with Dynamic Omission Failures
• The weakest failure detector for solving consensus
• scientific article; zbMATH DE number 1950666 (Why is no real title available?)
• Randomized protocols for asynchronous consensus
• Condition-based consensus solvability: a hierarchy of conditions and efficient protocols
• The weakest failure detector to solve nonuniform consensus
• Stochastic and deterministic fault detection for randomized gossip algorithms
• Randomization and failure detection: a hybrid approach to solve consensus
• Verification of consensus algorithms using satisfiability solving
• Randomization can be a healer: consensus with dynamic omission failures
• Bounded cost algorithms for multivalued consensus using binary consensus instances
• Implementing uniform reliable broadcast with binary consensus in systems with fair-lossy links

This page was built for publication: Failure Detection and Randomization: A Hybrid Approach to Solve Consensus

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