Generalized measures of fault tolerance with application to N-cube networks

Journal Article · Wed Nov 01 04:00:00 EST 1989 · IEEE (Institute of Electrical and Electronics Engineers) Transactions on Computers; (USA)

DOI:https://doi.org/10.1109/12.42131· OSTI ID:5242881

Esfahanian, A H ^[1]

---

1. Michigan State Univ., East Lansing, MI (USA). Dept. of Computer Science

In developing deterministic measures of system-level fault tolerance for multiple processor systems, it has generally been assumed that any subset of system components (processors or links) can potentially fail at the same time. In this paper, the authors generalize these measures by restricting the potentially faulty sets to some subsets of the system components. Using this model, they present a new fault-tolerance analysis for the n-cube networks. In particular, they show that such networks can tolerate up to 2n-3 processor failures and remain connected provided that for each processor rho in the network, all the processors which are directly connected to rho do not fail at the same time. The authors also show that in this situation, the diameter of the network may increase only by a constant value. The author present an O(({kappa}n)/sup 2/) time algorithm for determining if the network is disconnected with a set of {kappa}, {kappa} {le} 2n-2, faulty processors is given. The previously known algorithms for the same purpose require O(n.2/sup n-1/) computation steps.

• OSTI ID: 5242881
• Journal Information: IEEE (Institute of Electrical and Electronics Engineers) Transactions on Computers; (USA), Journal Name: IEEE (Institute of Electrical and Electronics Engineers) Transactions on Computers; (USA) Vol. 38:11; ISSN ITCOB; ISSN 0018-9340
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS
990200* -- Mathematics & Computers
ALGORITHMS
ARRAY PROCESSORS
COMPUTER NETWORKS
COMPUTERS
DIGITAL COMPUTERS
FAULT TOLERANT COMPUTERS
HYPERCUBE COMPUTERS
MATHEMATICAL LOGIC