2003 · 52 citations · 9 references
ComputingComputer EngineeringComputer ScienceFault ToleranceFault-tolerant ComputingFault-tolerant SystemsData RedundancyFault Tolerance DesignFault Tolerance In Parallel SystemsHardware Fault ToleranceParallel Computing SystemsReliable System DesignData ConsistencyFailure ProbabilityFailure Probability AnalysisFault Tolerance ArchitectureFault Tolerance In MultiprocessorsFault-tolerant ArchitectureFault-tolerant Processor DesignOverhead Analysis
The authors address issues central to the design and operation of a Byzantine resilient parallel computer. Interprocessor connectivity requirements are met by treating connectivity as a resource which is shared among many processing elements, allowing flexibility in their configuration and reducing complexity. Reliability analysis results are presented which demonstrate the reduced failure probability of such a system. Redundant groups are synchronized solely by message transmissions and receptions, which also provide input data consistency and output voting. Performance analysis results are presented which quantify the temporal overhead involved in executing such fault tolerance-specific operations.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">></ETX>
9
Reaching Agreement in the Presence of Faults
Marshall C. Pease, Robert E. Shostak, Leslie Lamport · Journal of the ACM · 1980 · 2.4K citations · Full text
The Byzantine generals strike again
Danny Dolev · Journal of Algorithms · 1982 · 573 citations