Pierce | Failure-Tolerant Computer Design | E-Book | www.sack.de
E-Book

E-Book, Englisch, 256 Seiten, Web PDF

Pierce Failure-Tolerant Computer Design


1. Auflage 2014
ISBN: 978-1-4832-6347-2
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, 256 Seiten, Web PDF

ISBN: 978-1-4832-6347-2
Verlag: Elsevier Science & Techn.
Format: PDF
Kopierschutz: 1 - PDF Watermark



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 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.

Pierce Failure-Tolerant Computer Design jetzt bestellen!

Autoren/Hrsg.


Weitere Infos & Material


1;Front
Cover;1
2;Failure-Tolerant Computer Design;4
3;Copyright Page;5
4;Table of Contents;12
5;Dedication;6
6;Preface;8
7;CHAPTER I. Introduction to
Redundancy Theory;16
7.1;A. BASIC CONCEPTS FOR MAKING RELIABLE
COMPUTERS OUT OF UNRELIABLE PARTS;17
7.2;B. ERROR TYPES A N D RELIABILITY TYPES;22
8;CHAPTER II. Limit Theorems: A Foundation for
Redundancy Theory;24
8.1;A. INTRODUCTORY IDEAS ON RELIABILITY SYNTHESIS;25
8.2;B. RELIABILITY ASYMPTOTES OF PARALLELED UNITS;26
8.3;C. RELIABILITY OF MULTIPLE-FUNCTION SYSTEM WITH
PARALLELED INDIVIDUAL UNITS;31
8.4;D. A SYSTEMATIC PROCEDURE FOR SELECTING
THE NEXT IMPROVEMENT IN A SYSTEM;37
8.5;E. TIME ASYMPTOTES FOR LOG FAILURE PROBABILITY FOR EXPONENTIAL
SURVIVAL PROBABILITY;41
8.6;F. APPLICATIONS IN DETERMINING THE OPTIMUM
PLACEMENT OF RESTORING ORGANS;41
8.7;G. FAILURE PROBABILITY ASYMPTOTES FOR A
FIXED SYSTEM;42
8.8;H. A SHORT SUMMARY;44
8.9;PROBLEMS;45
9;CHAPTER III. Decision Theory
in Redundant Systems;47
9.1;A. CONCEPTS AND TECHNIQUES;47
9.2;B. THE LINEARLY SEPARABLE DECISION ELEMENT;48
9.3;C. DECISION THEORY AND VOTE-TAKING;51
9.4;D. RELIABILITY ANALYSIS OF VOTE-TAKERS;54
9.5;E. OPTIMUM AND OPTIMIZED SETTINGS OF VOTE-WEIGHTS
USING IMPERFECT INFORMATION;59
9.6;F. SUMMARY ON USING DECISION THEORY IN
REDUNDANT COMPUTERS;62
9.7;PROBLEMS;63
10;CHAPTER IV. Adaptive
Decision Elements;65
10.1;A. CYCLIC ERROR-COUNTING ADAPTION PROCEDURES;65
10.2;B. INCREMENTAL ADAPTION PROCEDURES;71
10.3;C. PLACEMENT OF DECISION ELEMENTS IN
REDUNDANT NETWORKS;81
10.4;D. SYSTEM RELIABILITY;85
10.5;E. SUMMARY;91
10.6;PROBLEMS;92
11;CHAPTER V. Interconnection Structure for
Redundant Logic;93
11.1;A. VOCABULARY FOR INTERWOVEN LOGIC;95
11.2;B. RESTORING ORGANS;100
11.3;C. INTERWOVEN LOGIC WITH SINGLE-LAYER
ERROR CORRECTION;104
11.4;D. INTERWOVEN LOGIC WITH ALTERNATING-LAYER
ERROR CORRECTION;109
11.5;E. SYSTEMATIC GROUPINGS OF INPUTS INALTERNATING-LAYER INTERWOVEN LOGIC;112
11.6;F. SYSTEMATIC GROUPINGS OF INPUTS IN SINGLE-LAYER ERROR-CORRECTING INTERWOVEN
REDUNDANT LOGIC;119
11.7;G. SUMMARY AND CONCLUSIONS;123
11.8;PROBLEMS;125
12;CHAPTER VI. Redundant
Relay Theory;130
12.1;A. THE h(p)
FUNCTION;130
12.2;B. THE MOORE-SHANNON LIMIT THEOREM;136
12.3;C. OTHER RELIABILITY TECHNIQUES RELATED TO THE MOORE AND SHANNON
PAPER;140
12.4;PROBLEMS;144
13;CHAPTER VII. The Place, If Any, of Coding Techniques in Failure-Tolerant Digital
Networks;147
13.1;A. HISTORICAL BACKGROUND;147
13.2;B. SYNTHESIS EXAMPLE;149
13.3;C. PLACEMENTS OF DECODERS;152
13.4;D. DECODER COMPLEXITY;158
13.5;E. CONCLUSIONS;159
13.6;PROBLEMS;160
14;CHAPTER VIII. Transition Analyses
in Reliability Theory;163
14.1;A. INTRODUCTORY MARKOV CHAIN THEORY;164
14.2;B. T W O RELIABILITY PROBLEMS FOR NONREDUNDANT
SYSTEMS;166
14.3;C. RELIABILITY ANALYSES FOR CHAINS OF
RESTORING ORGANS;171
14.4;D. PROBABILITY BOUNDS IN MARKOV CHAINS HAVING MANY STATES OR INEXACTLY KNOWN TRANSITION
MATRICES;177
14.5;E. APPLICATIONS OF PROBABILITY BOUNDS;184
14.6;PROBLEMS;185
15;CHAPTER IX. Conclusions, Comparisons and
Unsolved Problems;190
15.1;A. WHAT IS KNOWN;190
15.2;B. WHAT IS BEST;192
15.3;B. WHAT IS BEST;192
16;APPENDIX 1: Stability Analysis of Adaption Method II-B;196
16.1;Text;196
16.2;STABILITY EXAMPLE;208
16.3;PROBLEMS FOR APPENDIX I;213
17;APPENDIX 2: Equilibrium Analysis of Adaption Method III-A;216
18;APPENDIX 3: Optimized Incrementsfor Adaption Methods IV-A and IV-B;219
18.1;Text;219
19;APPENDIX 4: Limitations of All Schemes of Interwoven Alternating Layers;221
19.1;Text;221
20;APPENDIX 5: Reliability Analysis of Alternating Layer Schemes;225
20.1;Text;225
21;APPENDIX 6: Generationof B-Groupings;232
21.1;Text;232
22;APPENDIX 7: Existenceof Limitsfor "Equivalent Error Probability;233
22.1;Text;216
23;REFERENCES;236
24;BIBLIOGRAPHY ON REDUNDANCY TECHNIQUES;238
25;Author Index;254
26;Subject Index;255



Ihre Fragen, Wünsche oder Anmerkungen
Vorname*
Nachname*
Ihre E-Mail-Adresse*
Kundennr.
Ihre Nachricht*
Lediglich mit * gekennzeichnete Felder sind Pflichtfelder.
Wenn Sie die im Kontaktformular eingegebenen Daten durch Klick auf den nachfolgenden Button übersenden, erklären Sie sich damit einverstanden, dass wir Ihr Angaben für die Beantwortung Ihrer Anfrage verwenden. Selbstverständlich werden Ihre Daten vertraulich behandelt und nicht an Dritte weitergegeben. Sie können der Verwendung Ihrer Daten jederzeit widersprechen. Das Datenhandling bei Sack Fachmedien erklären wir Ihnen in unserer Datenschutzerklärung.