A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 6, Issue 5, 1995, Pages 482-497

  Gaughan, Patrick T ^a   Yalamanchili, Sudhakar ^b  

^a UNIVERSITY OF ALABAMA   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER ARCHITECTURE; COMPUTER NETWORKS; CONSTRAINT THEORY; FAULT TOLERANT COMPUTER SYSTEMS; INTERCONNECTION NETWORKS; MULTIPROCESSING SYSTEMS; PERFORMANCE; PIPELINE PROCESSING SYSTEMS; SWITCHING CIRCUITS;

INTERPROCESSOR COMMUNICATION; MISROUTING BACKTRACKING; PIPELINED CIRCUIT SWITCHING; PIPELINED COMMUNICATION MECHANISM; WORMHOLE ROUTING;

NETWORK PROTOCOLS;

EID: 0029305385     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.382317     Document Type: Article

References (26)

1. P. Berman, L. Gravano, J. Sanz, and G. Pifarre, “Adaptive deadlock-and and livelock-free routing with all minimal paths in torus networks,” in Proc. 4th ACM Symp. Parallel Algorithms, Architect., June 1992.
2. S. Borkar, R. Cohn, G. Cox, T. Gross, H. T. Kung, M. Lam, M Levine, B. Moore, W. Moore, C. Peterson. J. Susman, J. Sutton, J. Urbanski, and J. Webb, “Supporting systolic and memory communication in iWarp,” in Proc. 17th Int. Symp. Comput. Architect., 1990, pp. 70-81.
3. M. S. Chen and K. G. Shin, “Adaptive fault-tolerant routing in hypercube cube multicomputers,” IEEE Trans. Comput., vol. 39, pp, 1406-1416, Dec. 1990.
4. “Depth-first search approach for fault-tolerant routing in hypercube cube multicomputers,” IEEE Trans. Parallel and Distrib. Syst., vol. 1, pp. 152-159, Apr. 1990.
5. A. A. Chien, “A cost and speed model for k-ary n-cube wormhole routers,” in Proc. Hot Interconn. Workshop, Aug. 1993.
6. A. A. Chien and J. H. K i m, “Planar-adaptive routing: Low-cost adaptive networks for multiprocessors,” in Proc. 19th int. Symp. Comput. Architect., May 1992, vol. 20, no. 2, pp. 268-277.
7. E. Chow, H. S. Madan, J. C. Peterson, D. Grunwald, and D. Reed, “Hyperswitch network for the hypercube computer,” in Proc. 15th Annu. Symp. Comput. Architect., 1988, pp. 90-99.
8. W. J. Daily, “Virtual-channel flow control,” IEEE Trans. Parallel, Distrib. Syst., vol. 3, pp. 194-205. Mar. 1992.
9. W. J. Daily and H. Aoki, “Deadlock-free adaptive routing in multicomputer networks using virtual channels,” IEEE Trans. Parallel, Distrib. Syst., 1993.
10. W. J. Daily and C. L. Seitz, “Deadlock-free message routing in multi-processor interconnection networks,” IEEE Trans. Comput., vol. C-36, pp. 547-553, May 1987.
11. J. T. Draper and J. Ghosh, “Multipath c-cube algorithms (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes,” in Proc. 6th int. Parallel Process. Symp., Mar. 1992, pp. 407-410.
12. J. Duato, “Deadlock-free adaptive routing algorithms for multicomputers: ers: Evaluation of a new algorithm,” in Proc. IEEE Symp. Parallel, Distrib. Process., 1991, pp. 840-847.
13. “On the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies,” in Proc. Parallel Architect. Lang. Europe'91, 1991.
14. D. Ferrari, Computer Systems Performance Evaluation. Englewood Cliffs, NJ: Prentice-Hall, 1978.
15. P. T. Gaughan and S. Yalamanchili, “Pipelined circuit-switching: A fault-tolerant variant of wormhole routing,” in Proc. IEEE Symp. Parallel, Distrib. Processing, Dec. 1992.
16. “Analytical models of bandwidth allocation in pipelined k-sty n-cubes,” in Proc. 7th Int. Parallel Process. Symp., Apr. 1993.
17. C. J. Glass and L. M. Ni, “The turn model for adaptive routing,” in Proc. 19th Int. Symp. Comput. Arch., May 1992, vol. 20, no. 2, pp. 278-287.
18. J. M Gordon and Q. Stout, “Hypercube routing in the presence of faults,” in Proc. 3rd Conf. Hypercube Concurr., Comput., Appl., 1988, pp. 318-327.
19. D. Grunwald and D. Reed, “Analysis of backtracking routing in binary hypercube computers,” Dep. Comput. Sci., Univ. Illinois at Urbana-Champaign, Champaign, Tech. Rep. UIUCDCS-R-89-1486, Feb. 1989.
20. C. R. Jesshope, P. R. Miller, and J. T. Yanchev, “High performance communications in processor networks,” in Proc. 6th Int. Symp. Comput. Architect., 1989, pp. 150-157.
21. C. K. Kim and D. Reed, “Adaptive packet routing in hypercube computer,” in Proc. 3rd Conf. Hypercube Concurr. Comput. Applic., Jan. 1988.
22. T. Z. Lee and J. P. Hayes, “Routing and broadcasting in faulty hypercube computers,” in Proc. 3rd Conf. Hypercube Concurr. Comput. Applic., 1988, pp. 346-354.
23. C. T. Liang, S. Bhattacharya, and W. T. Tsai, “Distributed fault tolerant routing in the presence of faults,” in Proc. 3rd Symp. Parallel, Distrib. Process., 1991, pp. 474-481.
24. D. H. Linder and J. C. Harden, “An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes,” IEEE Trans. Comput., vol. 40, pp. 2-12, Jan. 1991.
25. D. S. Reeves, E. F. Gehringer, and A. Chandiramani, “Adaptive routing and deadlock recovery: A simulation study,” in Proc. 4th Conf. Hypercube Concurr. Comput. Applic., Mar. 1989.
26. A. Robles and J. Duato, “Multilinks: A new approach to the design of adaptive routing algorithms for multicomputers,” in Proc. IMACS-IFAC Symp. Parallel Distrib. Comput. big. Syst., June 1991.