Asynchronous Fault-Tolerant Total Ordering Algorithms

DOI10.1137/0222048MaRDI QIDQ3137707zbMATH OpenOpenAlexFDO

Authors Vivek Agrawala, L. E. Moser, P. M. Melliar-Smith

Publication date 10 October 1993

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

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

zbMATH Keywords

fault-tolerant distributed systemsprobabilistic algorithms

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Theory of operating systems (68N25) Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Parallel algorithms in computer science (68W10)

Recommendations

• Asynchronous consensus and broadcast protocols
• scientific article; zbMATH DE number 2080904
• Impossibility of distributed consensus with one faulty process
• Byzantine-resistant total ordering algorithms.
• Fast and simple distributed consensus

Cited in

(6)

• Allowable processing orders in the accelerated cascade algorithm
• Fault-tolerant critical section management in asynchronous environments
• Byzantine-resistant total ordering algorithms.
• scientific article; zbMATH DE number 2090637 (Why is no real title available?)
• Total ordering algorithms for asynchronous Byzantine systems
• Tolerance to asynchrony in algorithms for multiplication and modulo

This page was built for publication: Asynchronous Fault-Tolerant Total Ordering Algorithms

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