Cluster fault tolerant routing in hypercubes

Proceedings of the International Conference on Parallel Processing

Volumn , Issue , 1998, Pages 148-155

  Gu, Qian Ping ^a   Peng, Shietung ^a  

^a UNIVERSITY OF AIZU   (Japan)

Author keywords

[No Author keywords available]

Indexed keywords

FAULT TOLERANCE; GEOMETRY; HYPERCUBE NETWORKS; NETWORK ARCHITECTURE;

FAULT TOLERANT ROUTING; FAULT-TOLERANT; FAULTY NODE; NODE-DISJOINT PATHS; ROUTING PATH; ROUTING PROBLEMS; SOURCE NODES; TARGET NODES;

GRAPH THEORY;

EID: 0042277615     PISSN: 01903918     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICPP.1998.708475     Document Type: Conference Paper

References (17)

1. J. C. Bermond. Interconnection networks. Discrete Applied Math., Special issue (Edited), 1992.
2. J. C. Bermond, N. Homobono, and C. Peyrat. Large faulttolerant interconnection networks. Graphs and Combinatorics, 5, 1989.
3. J. Bruck, R. Cypher, and D. Soroker. Tolerant faults in hypercubes using subcube partitioning. IEEE Trans. on Computers, pages 599-605, 1992.
4. M.S. Chen and K.G. Shin. Depth-first search approach for fault-tolerant routing in hypercube multiprocessors. IEEE Trans. on Parallel and Distributed Systems, pages 152-159, 1990.
5. A. H. Esfahanian. Generalized measures of fault tolerance with application to n-cube networks. IEEE Trans. on Computers, 38(11):1586-1591, 1989.
6. Q. Gu and S. Peng. Advanced fault tolerant routing in hypercubes. In Proc. of the International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'94), pages 189-196, 1994.
7. Q. Gu and S. Peng. Node-to-node cluster fault tolerant routing in star graphs. Information Processing Letters, 56:29-35, 1995.
8. Q. Gu and S. Peng. Optimal algorithms for node-to-node fault tolerant routing in hypercubes. The Computer Journal, 39(7):626-629, 1996.
9. Q. Gu and S. Peng. k-pairwise cluster fault tolerant routing in hypercubes. IEEE Trans. on Computers, 46(9):1042-1049, 1997.
10. D. F. Hsu. Interconnection networks and algorithms. Networks, Special issue 23(4), 1993.
11. D. F. Hsu. On container with width and length in graphs, groups, and networks. IEICE Trans. on Fundamental of Electronics, Information, and Computer Sciences, E77-A(4):668-680, 1994.
12. S. Latifi, M. Hedge, and M. Naraghi-Pour. Conditional connectivity measures for large multipprocessor systems. IEEE Trans. on Computers, 43(2):218-222, 1994.
13. T.C. Lee and J.P. Hayes. A fault-tolerant communication scheme for hypercube computers. IEEE Trans. on Computers, pages 1242-1256, 1992.
14. J. McHugh. Algorithmic Graph Theory. Prentice-Hall Inc., 1990.
15. M. Peercy and P. Banerjee. Optimal distributed deadlock-free algorithms for routing and broadcasting in arbitrarily faulty hypercubes. In Proc. of the 20th International Symposium on Fault-Tolerant Computing, 1990.
16. C.S. Raghavendra, P.J. Yang, and S.B. Tien. Free dimensions-an efficient approach to archieving fault tolerance in hypercube. IEEE Trans. on Computers, Vol. 44:1152-1157, 1995.
17. S.B. Tien and C.S. Raghavendra. Algorithms and bounds for shortest paths and diameter in faulty hypercubes. IEEE Trans. on Parallel and Distributed Systems, pages 713-718, 1993.