This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels
February 1996 (vol. 7 no. 2)
pp. 138-150

Abstract—This paper focuses on efficient multicasting in wormhole-routed networks. A trip-based model is proposed to support adaptive, distributed, and deadlock-free multiple multicast on any network with arbitrary topology using at most two virtual channels per physical channel. This model significantly generalizes the path-based model proposed earlier [21], [22], which works only for Hamiltonian networks and cannot be applicable to networks with arbitrary topology resulted due to system faults. Fundamentals of the trip-based model, including the necessary and sufficient condition to be deadlock-free, and the use of appropriate number of virtual channels to avoid deadlock are investigated. The potential of this model is illustrated by applying it to hypercubes with faulty nodes. Simulation results indicate that the proposed model can implement multiple multicast on faulty hypercubes with negligible performance degradation.

[1] MPI: A Message-Passing Interface Standard. Message Passing Interface Forum, May 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. Bertsekas, C. Ozveren, G. Stamoulis, P. Tseng, and J. Tsitsiklis, "Optimal Communication Algorithms for Hypercubes," J. Parallel and Distributed Computing, 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," Proc. 19th Int'l Symp. Computer Architecture, vol. 20, no. 2, pp. 268-277, May 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 Distributed 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. C-36, No. 5, May 1987, pp. 547-553.
[11] 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.
[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.New York: W.H. Freeman, 1979.
[14] 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.
[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,“Spanning graphs for optimum broadcasting and personalizedcommunication 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 Distributed Computing, vol. 8, pp. 30-41, Jan. 1990.
[20] D. Lenoski et al., "The directory-based cache coherence protocol for the dash multiprocessor," Proc. 17th Int'l Symp. Computer Architecture,Los Alamitos, Calif., pp. 148-159, 1990.
[21] X. Lin, P.K. McKinley,, and L.M. Ni,"Deadlock-Free Multicast Wormhole Routing in 2-D Mesh Multicomputers," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 8, Aug. 1994, pp. 793-804.
[22] X. Lin and L. Ni, "Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks," Proc. Int'l Symp. Computer Architecture, June 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 Direct Networks," Computer, vol. 26, no. 2, 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. Stamoulis and J. Tsitsiklis, "Efficient Routing Schemes for Multiple Broadcasts in Hypercubes," IEEE Trans. Parallel and Distributed 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.

Index Terms:
Routing algorithm, interprocessor communication, multicast, virtual channel, wormhole-routing, path-based routing, collective communication, fault tolerance.
Citation:
Yu-Chee Tseng, Dhabaleswar K. Panda, Ten-Hwang Lai, "A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 2, pp. 138-150, Feb. 1996, doi:10.1109/71.485503
Usage of this product signifies your acceptance of the Terms of Use.