Fault-tolerant wormhole routing in tori

Proceedings of the International Conference on Supercomputing

Volumn Part F129421, Issue , 1994, Pages 146-155

  Chalasani, Suresh ^a   Boppana, Rajendra V ^b  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b UNIVERSITY OF TEXAS AT SAN ANTONIO   (United States)

Author keywords

Adaptive routing; Deadlocks; Fault tolerant routing; Message routing; Multicomputer networks; Performance evaluation; Torus networks; Worm hole routing

Indexed keywords

ADAPTIVE ALGORITHMS; FAULT TOLERANCE;

ADAPTIVE ROUTING; DEADLOCKS; FAULT TOLERANT ROUTING; MESSAGE ROUTING; MULTICOMPUTER NETWORK; PERFORMANCE EVALUATION; TORUS NETWORKS; WORM HOLE ROUTING;

NETWORK ARCHITECTURE;

EID: 80054998014     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/181181.181330     Document Type: Conference Paper

References (27)

1. A. Agarwal, et al. The MIT Alewife machine: A largescale distributed multiprocessor. In Proc. of Workshop on Scalable Shared Memory Multiprocessors. Kluwer Academic Publishers, 1991.
2. R. Alverson, D. Callahan, D. Cummings, B. Koblenz, A. Porterfield, and B. Smith. The Tera computer system. In Proc. 1990 Int. Conf. on Supercomputing.
3. K. Bolding and L. Snyder. Overview of fault handling for the chaos router. In Proceedings of the 1991 IEEE International Workshop on Defect and Fault Tolerance in VLSI Systems, pages 124-127, 1991.
4. R. V. Boppana and S. Chalasani. A comparison of adaptive wormhole routing algorithms. In Proc. 20th Ann. Int. Symp. on C'omput. Arch., pages 351-360, May 1993.
5. R. V. Boppana and S. Chalasani. Fault-tolerant wormhole routing algorithms for mesh networks. Submitted for publication, Dec. 1993.
6. S. Borkar et al. iWarp: An integrated solution to highspeed parallel computing. In Pr-oc. Super-computing '88, pages 330-339.
7. A. A. Chien and J. H. Kim. Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. In Proc. 19th Ann. Int. Symp. on Comput. Arch., pages 268-277, 1992.
8. W. J. Dally. Virtual-channel flow control. IEEE Trans. on Parallel and Distributed Systems, 3(2):194-205, Mar. 1992.
9. W. J. Dally and H. Aoki. Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE Trans. on Parallel and Distributed Systems, 4(4):466-475, April 1993.
10. W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. on Computers, C-36(5):547-553, 1987.
11. J. Duato. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. on Parallel and Distributed Systems, 4(12):1320-1331, Dec. 1993.
12. S. A. Felperin, L. Gravano, G. D. Pifarr4, and J. L. Sanz. Routing techniques for massively parallel communication. Proceedings of the IEEE, 79(4):488-503, 1991.
13. P. T. Gaughan and S. Yalamanchili. Pipelined circuitswitching: A fault-tolerant variant of wormhole routing. In Proc. Fourth IEEE Symp. on Parallel and Distributed Processing, pages 148-155, 1992.
14. C. J. Glass and L. M. Ni. Fault-tolerant wormhole routing in meshes. In Twenty-Thzrd Annual Int. Symp. on Fault-Tolerant Cornputzng, pages 240-249, 1993.
15. I. S. Gopal. Prevention of store-and-forward deadlock in computer networks. IEEE Trans. on Communications, COM-33(12):1258-1264, Dec. 1985.
16. P. Kermani and L. Kleinrock. Virtual Cut-Through: A New Computer Communication Switching Technique. Computer Networks, 3:267-286, 1979.
17. J. H. Kim and A. A. Chien. An evaluation of planaradaptive routing (PAR). In Proc. Fourth IEEE Symp. on Parallel and Distributed Processing, 1992.
18. S. S. Lam and M. Reiser. Congestion control of storeand-forward networks by input buffer limits-an analysis. IEEE Trans. on Communcations, com-27(1):127-133, Jan. 1979.
19. T. Lee and J. Hayes. A fault-tolerant communication scheme for hypercube computers. IEEE Trans. on Computers, 41(10):1242-1256, Oct. 1992.
20. S. L. Lillevik. The Touchstone 30 Gigaflop DELTA prototype. In Saxth Distributed Memory Computing Conference, pages 671-677, 1991.
21. D. H. Linder and J. C. Harden. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Trans. on Computers, 40(1):2-12, 1991.
22. M.D. Noakes et al. The J-machine multicomputer: An architectural evaluation. In Proc. 20th Ann. lnt. Symp. on Comput. Arch., pages 224-235, May 1993.
23. A. L. Narasimha Reddy and R. Freitas. Fault tolerance of adaptive routing algorithms in multicomput ers. In Proc. Fourth IEEE Symp. on Parallel and Dwtributed Processing, pages 156-161, 1992.
24. J. Y. Ngai and C. L. Seitz. A framework for adaptive routing in multicomputer networks. In Proc. last Symp. on Parallel Algorithms and Architectures, 1989.
25. W. Oed. The tray research massively parallel processor system, CRAY T3D. Technical report, Cray Research Inc., Nov. 1993.
26. C. S. Raghavendra, P.-J. Yang, and S.-B. Tien. Free dimensions-an effective approach to achieving fault tolerance in hypercubes. In Twentg-Second Annual Int. Symp. on Fault-Tolerant Computing, pages 170-177, 1992.
27. C. Seitz. Concurrent architectures. In R. Suaya and G. Birtwislte, editors, VLSI and Parallel Computation, chapter 1, pages 1-84. Morgan-Kaufman Publishers, Inc., San Mateo, California, 1990.