The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.04 - April (1994 vol.43)
pp: 470-475
ABSTRACT
<p>Fault tolerance of interconnection networks is one of the major considerations in evaluating the reliability of large scale multiprocessor systems. In the paper, the reliability of a family of regular networks with respect to edge failures is investigated using four different fault tolerance measures. Two probabilistic measures, resilience and restricted resilience, are developed, used to evaluate disconnection likelihoods using two different failure models, and compared with corresponding deterministic measures. The network topologies chosen for the present study all have the recursive decomposition property, where larger networks can be decomposed into copies of smaller networks of the same topology. This family of graphs includes the k-ary n-cube, star and cube connected cycle graphs, which have optimal deterministic connectivities. The probabilistic fault tolerance measures, however, are found to depend on topological properties such as network size and degree.</p>
INDEX TERMS
multiprocessor interconnection networks; network topology; fault tolerant computing; edge fault tolerance; recursively decomposable; regular networks; interconnection networks; reliability; large scale multiprocessor; edge failures; fault tolerance measures; probabilistic measures; resilience; restricted resilience; network topologies; probabilistic fault tolerance measures; topological properties.
CITATION
A. Lagman, W.A. Najjar, P.K. Srimani, "An Analysis of Edge Fault Tolerance in Recursively Decomposable Regular Networks", IEEE Transactions on Computers, vol.43, no. 4, pp. 470-475, April 1994, doi:10.1109/12.278484
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool