The Community for Technology Leaders
Green Image
<p>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.</p>
Index Termsbounds; shortest paths; faulty hypercubes; n-dimensional hypercube; complexity;diameter; computational complexity; fault tolerant computing; hypercube networks;parallel algorithms

C. Raghavendra and S. Tien, "Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 713-718, 1993.
88 ms
(Ver 3.3 (11022016))