Optimal, and reliable communication in hypercubes using extended safety vectors

IEEE Transactions on Reliability

Volumn 54, Issue 3, 2005, Pages 402-411

  Wu, Jie ^a   Gao, Feng ^b   Li, Zhongcheng ^c   Min, Yinghua ^c  

^a Florida Atlantic University   (United States)

^b UNIVERSITY OF MICHIGAN   (United States)

^c INSTITUTE OF COMPUTING TECHNOLOGY   (China)

Author keywords

Fault tolerant routing; Generalized hypercubes; Multicomputers; Reliable communication; Safety vectors

Indexed keywords

ALGORITHMS; CODES (SYMBOLS); COMPUTATIONAL COMPLEXITY; COMPUTER SIMULATION; ENCODING (SYMBOLS); MATHEMATICAL MODELS;

FAULT TOLERANT ROUTING; GENERALIZED HYPERCUBES; RELIABLE COMMUNICATION; SAFETY VECTOR MODEL;

FAULT TOLERANT COMPUTER SYSTEMS;

EID: 27844490095     PISSN: 00189529     EISSN: None     Source Type: Journal    
DOI: 10.1109/TR.2005.853439     Document Type: Article

References (15)

1. M. S. Chen and K. G. Shin, "Adaptive fault-tolerant routing in hypercube multicomputers," IEEE Trans. Comput., vol. 39, no. 12, pp. 1406-1416, Dec. 1990.
2. NCUBE Company, NCUBE 6400 Processor Manual, 1990.
3. J. Duato, "A theory of fault-tolerant routing in wormhole networks," IEEE Trans. Parallel Distrib. Syst., vol. 8, no. 8, pp. 790-802, Aug. 1998.
4. P. T. Ganghan and S. Yalamanchili, "A family of fault-tolerant routing protocols for direct multiprocessor networks," IEEE Trans. Parallel Distrib. Syst., vol. 6, no. 5, pp. 482-497, May 1995.
5. Q. P. Gu and S. Peng, "Unicast in hypercubes with large number of faulty nodes," IEEE Trans. Parallel Distrib. Syst., vol. 10, no. 10, pp. 964-975, Oct. 1999.
6. W. D. Hills, The Connection Machine. Cambridge, MA: MIT Press, 1985.
7. Y. Lan, "A fault-tolerant routing algorithm in hypercubes," in Proc. 1994 Int. Conf. Parallel Processing, Aug. 1994, pp. III 163-III 166.
8. T. C. Lee and J. P. Hayes, "A fault-tolerant communication scheme for hypercube computers," IEEE Trans. Comput., vol. 41, no. 10, pp. 1242-1256, Oct. 1992.
9. C. S. Raghavendra, P. J. Yang, and S. B. Tien, "Free dimensions - an effective approach to achieving fault tolerance in hypercubes," in Proc. 22nd Int. Symp. Fault-Tolerant Computing, 1992, pp. 170-177.
10. J. Rattler, "Concurrent processing: a new direction in scientific computing," in Proc. AFIPS Conf., vol. 54. 1985, pp. 157-166.
11. S. B. Tien and C. S. Raghavendra, "Algorithms and bounds for shortest paths and diameter in faulty hypercubes," IEEE Trans. Parallel Distrib. Syst., vol. 4, no. 6, pp. 713-718, Jun. 1993.
12. J. Wu, "Reliable communication in cube-based multicomputers using safety vectors," IEEE Trans. Parallel Distrib. Syst., vol. 9, no. 4, pp. 321-334, Apr. 1998.
13. J. Wu, "Unicasting in faulty hypercubes using safety levels," IEEE Trans. Comput., vol. 46, no. 2, pp. 241-247, Feb. 1997.
14. J. Wu and E. B. Fernandez, "Broadcasting in faulty hypercubes," in Proc. 11th Symp. Reliable Distributed Systems, Oct. 1992, pp. 122-129.
15. D. Xiang, "Fault-tolerant routing hypercube multicomputers using local safety information," IEEE Trans. Parallel Distrib. Syst., vol. 12, no. 9, pp. 942-951, Dec. 2001.