Failure Detection and Randomization: A Hybrid Approach to Solve Consensus
From MaRDI portal
Publication:4229413
DOI10.1137/S0097539796312915zbMath0918.68041MaRDI QIDQ4229413
Sam Toueg, Marcos Kawazoe Aguilera
Publication date: 22 February 1999
Published in: SIAM Journal on Computing (Search for Journal in Brave)
algorithmsreliabilityfault-tolerancerandomized algorithmsasynchronous systemsmessage passingconsensus problemcrash failuresagreement problemfailure detectionprocessor failuresByzantine generals' problem
Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Related Items (4)
Randomized protocols for asynchronous consensus ⋮ Condition-based consensus solvability: a hierarchy of conditions and efficient protocols ⋮ 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