Byzantine generals in action
- 1 May 1984
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Computer Systems
- Vol. 2 (2), 145-154
- https://doi.org/10.1145/190.357399
Abstract
A fail-stop processor halts instead of performing an erroneous state transformation that might be visible to other processors, can detect whether another fail-stop processor has halted (due to a failure), and has a predefined portion of its storage that will remain unaffected by failures and accessible to any other fail-stop processor. Fail-stop processors can simplify the construction of fault-tolerant computing systems. In this paper, the problem of approximating fail-stop processors is discussed. Use of fail-stop processors is compared with the state machine approach, another general paradigm for constructing fault-tolerant systems.Keywords
This publication has 8 references indexed in Scilit:
- Fail-stop processorsACM Transactions on Computer Systems, 1983
- The Byzantine Generals ProblemACM Transactions on Programming Languages and Systems, 1982
- A lower bound for the time to assure interactive consistencyInformation Processing Letters, 1982
- Synchronization in Distributed ProgramsACM Transactions on Programming Languages and Systems, 1982
- The Byzantine generals strike againJournal of Algorithms, 1982
- Chapter 11. Atomic transactionsLecture Notes in Computer Science, 1981
- Reaching Agreement in the Presence of FaultsJournal of the ACM, 1980
- Time, clocks, and the ordering of events in a distributed systemCommunications of the ACM, 1978