Implementing fault-tolerant services using the state machine approach: a tutorial
- 1 December 1990
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Computing Surveys
- Vol. 22 (4) , 299-319
- https://doi.org/10.1145/98163.98167
Abstract
The state machine approach is a general method for implementing fault-tolerant services in distributed systems. This paper reviews the approach and describes protocols for two different failure models—Byzantine and fail stop. Systems reconfiguration techniques for removing faulty components and integrating repaired components are also discussed.Keywords
This publication has 18 references indexed in Scilit:
- Preserving and using context information in interprocess communicationACM Transactions on Computer Systems, 1989
- Reliable scheduling in a TMR database systemACM Transactions on Computer Systems, 1989
- Reliable communication in the presence of failuresACM Transactions on Computer Systems, 1987
- Impossibility of distributed consensus with one faulty processJournal of the ACM, 1985
- Byzantine generals in actionACM Transactions on Computer Systems, 1984
- Using Time Instead of Timeout for Fault-Tolerant Distributed Systems.ACM Transactions on Programming Languages and Systems, 1984
- Fault-tolerant broadcastsScience of Computer Programming, 1984
- Synchronization in Distributed ProgramsACM Transactions on Programming Languages and Systems, 1982
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978
- Self-stabilizing systems in spite of distributed controlCommunications of the ACM, 1974