Failure-Tolerant Computer Design
- 1st Edition - January 1, 1965
- Imprint: Academic Press
- Author: William H. Pierce
- Language: English
- Paperback ISBN:9 7 8 - 1 - 4 8 3 2 - 5 5 0 4 - 0
- eBook ISBN:9 7 8 - 1 - 4 8 3 2 - 6 3 4 7 - 2
Failure-Tolerant Computer Design focuses on the use of redundancy theory in improving the reliability of computers. The book first offers information on redundancy theory and… Read more
Purchase options
Institutional subscription on ScienceDirect
Request a sales quoteFailure-Tolerant Computer Design focuses on the use of redundancy theory in improving the reliability of computers. The book first offers information on redundancy theory and limit theorems. Discussions focus on applications in determining the optimum placement of restoring organs; time asymptotes for log failure probability for exponential survival probability; reliability of multiple-function system with paralleled individual units; and basic concepts for making reliable computers out of unreliable parts. The text then examines decision theory in redundant systems and adaptive decision elements. The publication examines the interconnection structure for redundant logic and redundant relay theory. Topics include Moore-Shannon limit theorem; systematic groupings of inputs in single-layer error-correcting interwoven redundant logic; interwoven logic with alternating-layer error correction; and interwoven logic with single-layer error correction. The book also elaborates on transition analyses in reliability theory, including Markov chain theory and probability bounds in Markov chains having many states or inexactly known transition matrices. The manuscript is a vital source of data for engineers and researchers interested in failure-tolerant computer design.
PrefaceChapter I. Introduction to Redundancy Theory A. Basic Concepts for Making Reliable Computers out of Unreliable Parts B. Error Types and Reliability TypesChapter II. Limit Theorems: A Foundation for Redundancy Theory A. Introductory Ideas on Reliability Synthesis B. Reliability Asymptotes of Paralleled Units C. Reliability of Multiple-Function System with Paralleled Individual Units D. A Systematic Procedure for Selecting the Next Improvement in a System E. Time Asymptotes for Log Failure Probability for Exponential Survival Probability F. Applications in Determining the Optimum Placement of Restoring Organs G. Failure Probability Asymptotes for a Fixed System H. A Short Summary ProblemsChapter III. Decision Theory in Redundant Systems A. Concepts and Techniques B. The Linearly Separable Decision Element C. Decision Theory and Vote-Taking D. Reliability Analysis of Vote-Takers E. Optimum and Optimized Settings of Vote-Weights Using Imperfect Information F. Summary on Using Decision Theory in Redundant Computers ProblemsChapter IV. Adaptive Decision Elements A. Cyclic Error-Counting Adaption Procedures B. Incremental Adaption Procedures C. Placement of Decision Elements in Redundant Networks D. System Reliability E. Summary ProblemsChapter V. Interconnection Structure for Redundant Logic (The Theory of Interwoven Redundant Logic) A. Vocabulary for Interwoven Logic B. Restoring Organs C. Interwoven Logic with Single-Layer Error Correction D. Interwoven Logic with Alternating-Layer Error Correction E. Systematic Groupings of Inputs in Alternating-Layer Interwoven Logic F. Systematic Groupings of Inputs in Single-Layer Error-Correcting Interwoven Redundant Logic G. Summary and Conclusions ProblemsChapter VI. Redundant Relay Theory A. The h(p) Function B. The Moore-Shannon Limit Theorem C. Other Reliability Techniques Related to the Moore and Shannon Paper ProblemsChapter VII. The Place, if Any, of Coding Techniques in Failure Tolerant Digital Networks A. Historical Background B. Synthesis Example C. Placement of Decoders D. Decoder Complexity E. Conclusions ProblemsChapter VIII. Transition Analyses in Reliability Theory A. Introductory Markov Chain Theory B. Two Reliability Problems for Nonredundant Systems C. Reliability Analyses for Chains of Restoring Organs D. Probability Bounds in Markov Chains Having Many States or Inexactly Known Transition Matrices E. Applications of Probability Bounds ProblemsChapter IX. Conclusions, Comparisons, and Unsolved Problems A. What Is Known B. What Is Best C. What Is UnknownAppendix I. Stability Analysis of Adaption Method II-B Text Stability Example Problems for Appendix 1Appendix 2. Equilibrium Analysis of Adaption Method III-A TextAppendix 3. Optimized Increments for Adaption Methods IV-A and IV-B TextAppendix 4. Limitations of all Schemes of Interwoven Alternation Layers TextAppendix 5. Reliability Analysis of Alternating Layer Schemes TextAppendix 6. Generation of B-Groupings TextAppendix 7. Existence of Limits for "Equivalent Error Probability" TextReferencesBibliographyAuthor IndexSubject Index
- Edition: 1
- Published: January 1, 1965
- Imprint: Academic Press
- No. of pages: 256
- Language: English
- Paperback ISBN: 9781483255040
- eBook ISBN: 9781483263472
Read Failure-Tolerant Computer Design on ScienceDirect