Asynchronous Fault-Tolerant Total Ordering Algorithms

DOI10.1137/0222048zbMath0786.68007OpenAlexW2053719188MaRDI QIDQ3137707

Vivek Agrawala, P. Michael Melliar-Smith, Louise E. Moser

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

probabilistic algorithmsfault-tolerant distributed systems

Mathematics Subject Classification ID

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

Related Items (2)

Total ordering algorithms for asynchronous Byzantine systems ⋮ Byzantine-resistant total ordering algorithms.

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