Stopping times of distributed consensus protocols: a probabilistic analysis

DOI10.1016/0020-0190(87)90127-XMaRDI QIDQ1089784zbMATH OpenOpenAlexWikidataFDO

Authors Ozalp Babaoglu

Publication date 1987

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(87)90127-x

zbMATH Keywords

resiliencyByzantine agreementdistributed computing systemprocessorsreliable computingprobabilistic failuresystem executions

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Recommendations

• Simple constant-time consensus protocols in realistic failure models
• Randomized protocols for asynchronous consensus
• Fast and simple distributed consensus
• Impossibility of distributed consensus with one faulty process
• On the minimal synchronism needed for distributed consensus

Cites work

• scientific article; zbMATH DE number 3819094 (Why is no real title available?)
• scientific article; zbMATH DE number 3338194 (Why is no real title available?)
• scientific article; zbMATH DE number 3349081 (Why is no real title available?)
• Authenticated Algorithms for Byzantine Agreement
• Reaching Agreement in the Presence of Faults
• The Byzantine Generals Problem

Cited in

(5)

• Computing reliability intervals for k-resilient protocols
• Simple constant-time consensus protocols in realistic failure models
• Distributed Stopping for Average Consensus in Digraphs
• Closed schedulers: a novel technique for analyzing asynchronous protocols
• A crash-tolerant consensus algorithm in presence of probabilistic message omission

This page was built for publication: Stopping times of distributed consensus protocols: a probabilistic analysis

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