This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes
June 1993 (vol. 4 no. 6)
pp. 713-718

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.

[1] A.-H. Esfahanian, "Generalized measures of fault-tolerance ton-cube network,"IEEE Trans. Comput., vol. 38, pp. 1586-1591, Nov. 1989.
[2] F. Harary, J. P. Hayes, and H.-J. Wu, "Survey of the theory of hypercube graphs,"Comput. and Math. with Appl.vol. 15, pp. 277-289, 1988.
[3] M. S. Krishnamoorthy and B. Krishnamurthy, "Fault diameter of interconnection networks,"Comput. Math. Appl., vol. 13, no. 5/6, pp. 577-582, 1987.
[4] S. L. Johnsson and C.-T. Ho, "Optimal broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, pp. 1249-1268, Sept. 1989.
[5] T.-C. Lee and J. P. Hayes, "One-step-degradable fault tolerant hypercube," inProc. Distributed Memory Comp. Conf., 1990.
[6] W. Lin and V.K. Prasanna Kumar, "Efficient Histogramming on Hypercube SIMD Machines,"Computer Vision, Graphics, and Image Processing, Vol. 49, No. 1, Jan. 1990, pp. 104-120.
[7] D. Nassimi and S. Sahni, "Data broadcasting in SIMD computers,"IEEE Trans. Comput., vol. 30, Feb. 1981.
[8] E. M. Reingold, J. Nievergekt, and N. Deo,Combinatorial Algorithms. Englewood Cliffs, NJ: Prentice-Hall, 1977.
[9] Y. Saad and M. H. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, pp. 867-872, July 1988.
[10] S. B. Tien, C. S. Raghavendra, and M. A. Sridhar, "Reconfiguration embedded task graphs in faulty hypercubes by automorphisms," inProc. Hawaii Int. Conf. Syst. Sci., 1990, pp. 91-100.
[11] S.-B. Tien and C. S. Raghavendra, "Algorithms and bounds on shortest paths and diameter in faulty hypercubes," inProc. 28th Annu. Allerton Conf. Commun., Contr., Comput., Univ. Illinois, Urbana-Champaign, Oct. 1990.
[12] S.-B. Tien and C. S. Raghavendra, "Algorithms and bounds on shortest paths and diameter in faulty hypercubes," Tech. Rep., Elec. Eng. Dep., Southern Illinois Univ. at Carbondale, 1992.

Index Terms:
Index Termsbounds; shortest paths; faulty hypercubes; n-dimensional hypercube; complexity;diameter; computational complexity; fault tolerant computing; hypercube networks;parallel algorithms
Citation:
S.B. Tien, C.S. Raghavendra, "Algorithms and Bounds for Shortest Paths and Diameter in Faulty Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 6, pp. 713-718, June 1993, doi:10.1109/71.242151
Usage of this product signifies your acceptance of the Terms of Use.