Distributed, deadlock-free routing in faulty, pipelined, direct interconnection networks

IEEE Transactions on Computers

Volumn 45, Issue 6, 1996, Pages 651-665

  Gaughan, Patrick T ^a,c   Dao, Binh V ^b,c   Yalamanchili, Sudhakar ^b,c   Schimmel, David E ^b,c  

^a UNIVERSITY OF ALABAMA   (United States)

^b GEORGIA INSTITUTE OF TECHNOLOGY   (United States)

^c IEEE

Author keywords

Distributed recovery mechanism; Dynamic fault tolerance; Pipelined interconnection network; Reliable message delivery; Wormhole routing

Indexed keywords

COMPUTER SIMULATION; COMPUTER SYSTEM RECOVERY; DATA COMMUNICATION SYSTEMS; DISTRIBUTED COMPUTER SYSTEMS; NETWORK PROTOCOLS; PIPELINE PROCESSING SYSTEMS;

ACKNOWLEDGED PIPELINED CIRCUIT SWITCHING; DEADLOCK FREE COMMUNICATION; DISTRIBUTED RECOVERY MECHANISM; PIPELINED NETWORKS; WORMHOLE ROUTING;

INTERCONNECTION NETWORKS;

EID: 0030170426     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.506422     Document Type: Article

References (26)

1. J.D. Allen, P.T. Gaughan, D.E. Schimmel, and S. Yalamanchili, "Ariadne - An Adaptive Router for Fault-Tolerant Multicomputers," Proc. 21st Int'l Symp. Computer Architecture, pp. 278-288, Apr. 1994.
2. P. Berman, L. Gravano, J. Sanz, and G. Pifarre, "Adaptive Deadlock- and Livelock-Free Routing with All Minimal Paths in Torus Networks," Proc. Fourth ACM Symp. Parallel Algorithms and Architectures, June 1992.
3. R. Boppana and S. Chalasani, "A Comparison of Adaptive Wormhole Routing Algorithms," Proc. 20th Ann. Int'l Symp. Computer Architecture," pp. 351-360, 1993.
4. 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," Proc. 17th Int'l Symp. Computer Architecture, pp. 70-81, 1990.
5. M.S. Chen and K.G. Shin, "Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 1, no. 2, pp. 152-159, Apr. 1990.
6. A.A. Chien and J.H. Kim, "Planar-Adaptive Routing: Low-Cost Adaptive Networks for Multiprocessors," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 268-277, May 1992.
7. W.J. Dally, "Virtual-Channel Flow Control," IEEE Trans. Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
8. W.J. Dally and H. Aoki, "Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
9. W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks," IEEE Trans. Computers, vol. 36, no. 5, pp. 547-553, May 1987.
10. J.T. Draper and J. Ghosh, "Multipath e-Cube Algorithms (MECA) for Adaptive Wormhole Routing and Broadcasting in k-Ary n-Cubes," Proc. Sixth Int'l Parallel Processing Symp., pp. 407-410, Mar. 1992.
11. J. Duato, "Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Evaluation of a New Algorithm," Proc. IEEE Symp. Parallel and Distributed Processing, pp. 840-847, 1991.
12. J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Trans. Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
13. J. Duato, "A Theory to Increase the Effective Redundancy in Wormhole Networks," Personal Communication, 1993.
14. D. Ferrari, Computer Systems Performance Evaluation. Prentice Hall, 1978.
15. P.T. Gaughan, "Design and Analysis of Fault-Tolerant Pipelined Multiprocessor Networks," technical report, PhD thesis, Georgia Inst. of Technology, May 1994.
16. P.T. Gaughan and S. Yalamanchili, "Pipelined Circuit-Switching: A Fault-Tolerant Variant of Wormhole Routing," Proc. IEEE Symp. Parallel and Distributed Processing, Dec. 1992.
17. P.T. Gaughan and S. Yalamanchili, "Analytical Models of Bandwidth Allocation in Pipelined k-Ary n-Cubes," Proc. Seventh Int'l Parallel Processing Symp., Apr. 1993.
18. P.T. Gaughan and S. Yalamanchili, "A Family of Fault-Tolerant Routing Protocols for Directed Multiprocessor Networks," Technical Report GIT/CSRL-93/01, Georgia Inst. of Technology, available via anonymous ftp at ftp.eecom.gatech.edu:pub/csrl, Jan. 1993.
19. P.T. Gaughan and S. Yalamanchili, "A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 6, pp. 482-487, May 1995.
20. C.J. Glass and L.M. Ni, "The Turn Model for Adaptive Routing," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 278-287, May 1992.
21. C.J. Glass and L.M. Ni, "Fault-Tolerant Wormhole Routing in Meshes," Proc. 23rd Int'l Symp. Fault-Tolerant Computing, pp. 240-249, 1993.
22. C.R. Hesshope, P.R. Miller, and J.T. Yanchev, "High Performance Communications in Processor Networks," Proc. Int'l Symp. Computer Architecture, pp. 150-157, 1989.
23. J.H. Kim, Z. Liu, and A.A. Chien, "Compressionless Routing: A Framework for Adaptive and Fault Tolerant Routing," Proc. 21st Ann. Int'l Symp. Computer Architecture, pp. 289-300, Apr. 1994.
24. X. Lin and L. Ni, "Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks," Proc. Int'l Symp. Computer Architecture, June 1991.
25. D.S. Reeves, E.F. Gehringer, and A. Chandiramani, "Adaptive Routing and Deadlock Recovery: A Simulation Study," Proc. Fourth Conf. Hypercube Concurrent Computing Applications, Mar. 1989.
26. J. Samson, "The Probability of the Occurrence of Soft Errors," Personal Communication, 1994.