Fault diameter of interconnection networks
Computers and Mathematics with Applications - Diagnosis and reliable design of VLSI systems
Topological Properties of Hypercubes
IEEE Transactions on Computers
Generalized Measures of Fault Tolerance with Application to N-Cube Networks
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Efficient histogramming on hypercube SIMD machines
Computer Vision, Graphics, and Image Processing
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes
IEEE Transactions on Computers
Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes
IEEE Transactions on Parallel and Distributed Systems
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results
IEEE Transactions on Computers
Free Dimensions-An Effective Approach to Achieving Fault Tolerance in Hypercubes
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
The hierarchical cliques interconnection network
Journal of Parallel and Distributed Computing
Largest connected component of a star graph with faulty vertices
International Journal of Computer Mathematics
| Hi-index | 0.02 |
In an n-dimensional hypercube Qn, with the fault set mod F mod 2/sub n-2/, assuming Sand D are not isolated, it is shown that there exists a path of length equal to at mosttheir Hamming distance plus 4. An algorithm with complexity O( mod F mod logn) is given to find such a path. A bound for the diameter of the faulty hypercube Qn-F, when mod F mod 2/sub n-2/, as n+2 is obtained. This improves the previously known bound of n+6 obtained by A.-H. Esfahanian (1989). Worst case scenarios are constructed to show that these bounds for shortest paths and diameter are tight. It is also shown that when mod F mod 2n-2, the diameter bound is reduced to n+1 if every node has at least 2 nonfaulty neighbors and reduced to n if every node has at least 3 nonfaulty neighbors.