A trip-based multicasting model in wormhole-routed networks with virtual channels

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 2, 1996, Pages 138-150

  Tseng, Yu Chee ^a,c   Panda, Dhabaleswar K ^a,b   Lai, Ten Hwang ^a,b  

^a IEEE

^b OHIO STATE UNIVERSITY   (United States)

^c CHUNG HUA UNIVERSITY   (Taiwan)

Author keywords

Collective communication; Fault tolerance; Interprocessor communication; Multicast; Path based routing; Routing algorithm; Virtual channel; Wormhole routing

Indexed keywords

ALGORITHMS; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER SIMULATION; COMPUTER SOFTWARE; DATA COMMUNICATION SYSTEMS; DATA STORAGE EQUIPMENT; DISTRIBUTED COMPUTER SYSTEMS; TELECOMMUNICATION TRAFFIC;

COLLECTIVE COMMUNICATION; DISTRIBUTED SHARED MEMORY SYSTEMS; FAULT TOLERANCE; INTERPROCESSOR COMMUNICATION; PATH BASED ROUTING; ROUTING ALGORITHMS; TRIP BASED MULTICASTING MODEL; VIRTUAL CHANNELS; WARMHOLE ROUTING NETWORKS;

COMPUTER NETWORKS;

EID: 0030084654     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.485503     Document Type: Article

References (31)

1. "MPI: A message-passing interface standard," Message Passing Interface Forum, Mar. 1994.
2. H. Abu-Amara, "A fast topology maintainance algorithm for high-bandwidth networks," IEEE/ACM Trans. Networks, vol. 1, no. 3, pp. 386-394, June 1993.
3. D.P. Bertsekas, C. Ozveren, G.D. Stamoulis, P. Tseng, and J.N. Tsitsiklis, "Optimal communication algorithms for hypercubes," J. Parallel and Distributing Computers, vol. 11, pp. 263-275, 1991.
4. G.I. Chen and T.H. Lai, "Constructing parallel paths between two subcubes," IEEE Trans. Computers, vol. 41, no. 1, pp. 118-123, Jan. 1992.
5. A.A. Chien and J.H. Kim, "Planar-adaptive routing: Low-cost adaptive networks for multiprocessors," Int'l Symp. Computer Architecture, pp. 268-277, 1992.
6. I. Cidon, I. Gopal, and S. Kutten, "New models and algorithms for future networks," Symp. Principle of Distributed Computing, pp. 75-89, 1988.
7. Cray Research, Inc., Cray T3D System Architecture Overview. 1993.
8. W.J. Dally, "Virtual-channel flow control," IEEE Trans. Parallel and Distributing Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
9. W.J. Dally and C.L. Seitz, "The torus routing chip," J. Parallel and Distributing Computers, vol. 1, no. 3, pp. 187-196, 1986.
10. W.J. Dally and C.L. Seitz, "Deadlock-free message routing in multiprocessor interconnection networks," IEEE Trans. Computers, vol. 36, pp. 547-553, May 1987.
11. J.T. Draper and J. Ghosh, "Multipath e-cube algorithm (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes," Int'l Parallel Processing Symp., pp. 407-410, 1992.
12. J. Duato, "A new theory of deadlock-free adaptive multicast routing in wormhole networks," Symp. Parallel and Distributing Processing, pp. 64-71, 1993.
13. M.R. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness. Freeman, 1979.
14. C.J. Glass and L.M. Ni, "The turn model for adaptive routing," Int'l Symp. Computer Architecture, pp. 278-287, 1992.
15. C.-T. Ho and M.-Y. Kao, "Optimal broadcast in all-port wormhole-routed hypercubes," Int'l Conf. Parallel and Distributing Systems, 1993.
16. J.M. Jaffe, "Distributed multi-destination routing: the constraints of local information," SIAM J. Computing, vol. 14, no. 4, pp. 875-888, Nov. 1985.
17. S.L. Johnsson and C.T. Ho, "Optimal broadcasting and personalized communication in hypercubes," IEEE Trans. Computers, vol. 38, no. 9, pp. 1,249-1,268, Sept. 1989.
18. Y. Lan, "Multicast in faulty hypercubes," Int'l Conf. Parallel Processing, pp. I-58-61, 1992.
19. Y. Lan, A.-H. Esfahanian, and L.M. Ni, "Multicast in hypercube multiprocessors. J. Parallel and Distributing Computers, vol. 8, pp. 30-41, 1990.
20. D. Lenoski et al., "The directory-based cashe coherence protocol for the DASH multi-processor," Int'l Symp. Computer Architecture, pp. 148-159, 1990.
21. X. Lin, P.K. McKinley, and L.M. Ni, "Deadlock-free multicast wormhole routing in 2D mesh multicomputers," IEEE Trans. Parallel and Distributing Systems, vol. 5, no. 8, pp. 793-804, Aug. 1994.
22. X. Lin and L.M. Ni, "Deadlock-free multicast wormhole routing in multicomputer networks," Int'l Symp. Computer Architecture, pp. 116-124, 1991.
23. D.H. Linder and J.C. Harden, "An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes," IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
24. P.K. McKinley and C. Trefftz, "Efficient broadcast in all-port wormhole-routed hypercubes," Int'l Conf. Parallel Processing, pp. II-288-291, 1993.
25. P.K. McKinley, H. Xu, A.-H. Esfahanian, and L.M. Ni, "Unicast-based multicast communication in wormhole-routed networks," Int'l Conf. Parallel Processing, pp. II-10-19, 1992.
26. L.M. Ni and P.K. McKinley, "A survey of wormhole routing techniques in directed networks," Computer, vol. 26, pp. 62-76, Feb. 1993.
27. H. Schwetman, Csim users' guide. Tech. Report ACT-126-90, MCC.
28. J.-P. Sheu and M.-Y. Su, "A multicast algorithm for hypercube multiprocessors," Int'l Conf. Parallel Processing, pp. III-18-22, 1992.
29. G.D. Stamoulis and J.N. Tsitsiklis, "Efficient routing schemes for multiple broadcasts in hypercubes," IEEE Trans. Parallel and Distributing Systems., vol. 4, no. 7, pp. 725-739, July 1993.
30. Y.-C. Tseng and T.-H. Lai, "Ring embedding in an injured hypercube," Int'l Conf. Parallel Processing, pp. III-149-152, 1993.
31. Y.-C. Tseng and D.K. Panda, "A trip-based multicasting model for wormhole-routed networks with virtual channels," Int'l Parallel Processing Symp., pp. 276-283, 1993.