A fault-tolerant adaptive and minimal routing approach in n-D meshes

Proceedings of the International Conference on Parallel Processing

Volumn 2000-January, Issue , 2000, Pages 431-438

  Wu, Jie ^a  

^a Florida Atlantic University   (United States)

Author keywords

Communication networks; Computer science; Costs; Fault tolerance; Fault tolerant systems; Network topology; Redundancy; Routing; Safety; System recovery

Indexed keywords

ACCIDENT PREVENTION; COMPUTER SCIENCE; COMPUTER SYSTEM RECOVERY; COSTS; NETWORK ROUTING; REDUNDANCY; ROUTING PROTOCOLS; TELECOMMUNICATION NETWORKS;

DEADLOCK-FREE ROUTING; FAULT DISTRIBUTION; FAULT TOLERANT SYSTEMS; LIMITED DISTRIBUTION; NETWORK TOPOLOGY; ROUTING; SYSTEM RECOVERY; TRADITIONAL MODELS;

FAULT TOLERANCE;

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

References (12)

1. M. S. Chen and K. G. Shin. Depth-first search approach for fault-tolerant routing in hypercube multicomputers. IEEE Transactions on Parallel and Distributed Systems. 1, (2), April 1990, 152-159.
2. A. A. Chien and J. H. Kim. Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. Journal of ACM. 42, (1), January 1995, 91-123.
3. W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Transactions on Computers. 36, (5), May 1987, 547-553.
4. J. Duato. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. IEEE Transactions on Parallel and Distributed Systems. 6, (10), 1995, 1,055-1,067.
5. E. Fleury and P. Fraigniaud. A general theory for deadlock avoidance in wormhole routed networks. IEEE Transactions on Parallel and Distributed Systems. 9, (7), July 1998, 626-638.
6. P. Fraigniaud and C. Gavoille. Memory requirement for universal routing schemes. Proc. of the 14th Annual ACM Symp. on Principles of Distributed Computing. 1995, 223-230.
7. D. T. Lee, C. D. Yang, and C. K. Wong. Rectilinear paths among rectilinear obstacles. Discrete Applied Mathematics. 70, 1996, 185-215.
8. D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Transactions on Computers. 40, (1), Jan. 1991, 2-12.
9. J. Wu. Adaptive fault-tolerant routing in cube-based multicomputers using safety vectors. IEEE Transactions on Parallel and Distributed Systems. 9, (4), April 1998, 321-334.
10. J. Wu. Fault-tolerant adaptive and minimal routing in mesh-connected multicomputers using extended safety levels. IEEE Transactions on Parallel and Distributed Systems. 11, (2), Feb. 2000, 149-159.
11. J. Wu. Reliable unicasting in faulty hypercubes using safety levels. IEEE Transactions on Computers. 46, (2), Feb. 1997, 241-247.
12. J. Wu. A simple fault-tolerant adaptive and minimal routing approach in 3-D meshes. Proc. of the 7th Int'l Conf. on Parallel and Distributed Systems (ICPADS). July 2000, to appear.