Asynchronous Fault-Tolerant Total Ordering Algorithms
- 1 August 1993
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 22 (4) , 727-750
- https://doi.org/10.1137/0222048
Abstract
No abstract availableKeywords
This publication has 10 references indexed in Scilit:
- Broadcast protocols for distributed systemsIEEE Transactions on Parallel and Distributed Systems, 1990
- Preserving and using context information in interprocess communicationACM Transactions on Computer Systems, 1989
- Reliable communication in the presence of failuresACM Transactions on Computer Systems, 1987
- On the minimal synchronism needed for distributed consensusJournal of the ACM, 1987
- Distributed agreement in the presence of processor and communication faultsIEEE Transactions on Software Engineering, 1986
- Asynchronous consensus and broadcast protocolsJournal of the ACM, 1985
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Reliable broadcast protocolsACM Transactions on Computer Systems, 1984
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978