DocumentCode
1115862
Title
An Algorithm for the Accurate Reliability Evaluation of Triple Modular Redundancy Networks
Author
Abraham, Jacob A. ; Siewiorek, Daniel P.
Author_Institution
Digital Systems Laboratory, Stanford University
Issue
7
fYear
1974
fDate
7/1/1974 12:00:00 AM
Firstpage
682
Lastpage
692
Abstract
There are several instances where the classical method of triple-modular redundancy (TMR) reliability modeling may provide predictions which are inadequate. It is shown that for even simple networks such as those exhibiting fan-in and fan-out, classical methods may predict a reliability that is higher than or lower than the actual reliability. Furthermore, the classical method gives no hint as to whether the predicted number is high or low. As a solution to this problem, a method of partitioning an arbitrary network into cells such that faults in a cell are independent of faults in other cells is proposed. An algorithm is then given to calculate the reliability of any such cell, by considering only the structure of the interconnections within the cells. The value of the reliability found is exact if TMR is assumed to be a coherent system. An approximation to the algorithm is also described; this can be used to find a lower bound to the reliability without extensive calculation.
Keywords
Coherent system, N-tuple modular redundancy, reliability modeling, serial cell, triple modular redundancy (TMR).; Approximation algorithms; Digital systems; Jacobian matrices; Laboratories; Life testing; Partitioning algorithms; Power system reliability; Predictive models; Redundancy; System testing; Coherent system, N-tuple modular redundancy, reliability modeling, serial cell, triple modular redundancy (TMR).;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.224016
Filename
1672609
Link To Document