Classes of Byzantine Fault-Tolerant Algorithms for Dependable Distributed Systems
A.J. Postma · 1998
1 1.1. Dependable computer systems 1 1.1.1. Dependability attributes 2 1.1.2. The impairments to dependability 3 1.1.2.1. Faults, errors, and failures 3 1.1.2.2. Fault and failure classification 3 1.1.3. Dependability measures 5 1.1.4. The means of dependability 7 1.1.5. Overview 11 1.2. Fault detection techniques 11 1.2.1. Duplication 11 1.2.2. Error-detecting codes 12 1.2.3. Checksums 12 1.2.4. Self-checking and fail-safe logic 12 1.2.5. Watch-dog timers and bus timeouts 13 1.2.6. Consistency and capability checks 13 1.2.7. Processor monitoring 14 1.2.8. Program monitoring 14 1.3. Fault-tolerance techniques 14 1.3.1. Masking redundancy techniques 15 1.3.1.1. N-modular redundancy 15 1.3.1.2. Error-correcting codes 16 1.3.1.3. Masking logic 17 1.3.1.4. N-version programming 17 1.3.2. Dynamic redundancy techniques 17 1.3.2.1. Reconfigurable duplication 17 1.3.2.2. Reconfigurable N-modular redundancy 18 1.3.2.3. Backup sparing 18 1.3.2.4. Graceful degradation 18 1.3.2.5. Forward an...