Reliability computation of multistage interconnection networks

A general algorithm that generates a reliability expression for these measures is presented. The reliability is analyzed under the assumption of statistical independence of failure. Nonetheless, failure dependencies can also be solved. This method is appropriate for analyzing other computer networks. To model networks with switching elements (SEs), the SE is considered as good or bad. The complex fault models are described. The analytic method is implemented by a Pascal program. The advantages of the proposed method are: (1) flexibility-this technique can handle statistically independent and dependent failures within the network, while failure dependencies use the Lam-Li model; this technique is easily extendable for the analysis of M-input N-output multistage interconnection networks; (2) generality-this technique derives the reliability of networks from the points of view of terminal reliability, broadcasting, and network reliability; and (3) cost effectiveness-the necessary system information can be obtained at very little additional cost, once the connection equation of the network has been obtained. >

[1]  S. Rai,et al.  An Efficient Method for Reliability Evaluation of a General Network , 1978, IEEE Transactions on Reliability.

[2]  Howard Jay Siegel,et al.  PASM: A Partitionable SIMD/MIMD System for Image Processing and Pattern Recognition , 1981, IEEE Transactions on Computers.

[3]  Kishor S. Trivedi Probability and Statistics with Reliability, Queuing, and Computer Science Applications , 1984 .

[4]  Kai Hwang,et al.  Combinatorial Reliability Analysis of Multiprocessor Computers , 1982, IEEE Transactions on Reliability.

[5]  Daniel Gajski,et al.  CEDAR: a large scale multiprocessor , 1983, CARN.

[6]  Dharma P. Agrawal,et al.  Design and Performance of Generalized Interconnection Networks , 1983, IEEE Transactions on Computers.

[7]  Duncan H. Lawrie,et al.  A Class of Redundant Path Multistage Interconnection Networks , 1983, IEEE Transactions on Computers.

[8]  Miroslaw Malek,et al.  RELIABILITY AND FAULT DIAGNOSIS ANALYSIS OF FAULT-TOLERANT MULTISTAGE INTERCONNECTION NETWORKS. , 1984 .

[9]  Chita R. Das,et al.  Reliability Simulation of Multiprocessor Systems , 1985, ICPP.

[10]  Miroslaw Malek,et al.  Reliability and Fail-Softness Analysis of Multistage Interconnection Networks , 1985, IEEE Transactions on Reliability.

[11]  Dharma P. Agrawal,et al.  Dynamic Accessibility Testing and Path Length Optimization of Multistage Interconnection Networks , 1985, IEEE Transactions on Computers.

[12]  J. Scott Provan Bounds on the Reliability of Networks , 1986 .

[13]  Y. F. Lam,et al.  Reliability Modeling and Analysis of Communication Networks with Dependent Failures , 1986, IEEE Trans. Commun..

[14]  Sudhakar M. Reddy,et al.  Augmented Shuffle-Exchange Multistage Interconnection Networks , 1987, Computer.

[15]  Salim Hariri,et al.  SYREL: A Symbolic Reliability Algorithm Based on Path and Cutset Methods , 1987, IEEE Transactions on Computers.

[16]  Dharma P. Agrawal,et al.  A Survey and Comparision of Fault-Tolerant Multistage Interconnection Networks , 1987, Computer.

[17]  Kishor S. Trivedi,et al.  Multistage Interconnection Network Reliability , 1989, IEEE Trans. Computers.