This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Achieving Fault-Tolerant Multicast in Injured Wormhole-Routed Tori and Meshes Based on Euler Path Construction
November 1999 (vol. 48 no. 11)
pp. 1282-1296

Abstract—Recently, wormhole routers with multidestination capability have been proposed to support fast multicast in a multicomputer network. To avoid communication deadlock, existing results have proposed to construct a Hamilton path, Euler path, trip, or their variants in the network, perhaps with some degree of support of virtual channels [1], [14], [15], [18], [23]. In this paper, we identify that a network which is itself Eulerian or is Eulerian after some links are removed, can enjoy the multidestination capability without support of virtual channels. From this definition, we then develop several techniques to achieve fault-tolerant multicast in a torus/mesh of any dimension with regular fault patterns (such as single node, block, L-shape, T-shape, $+$-shape, U-shape, and H-shape) and even irregular fault patterns. The result improves over existing results on the requirement of support of virtual channels and fault-tolerant capability. Simulation results on tori are presented.

[1] N. Agrawal and C.P. Ravikumar, “An Euler Path Based Technique for Deadlock-Free Multicasting,” Proc. Int'l conf. Parallel Processing, pp. 378-383, 1997.
[2] K.M. Al-Tawil, M. Abd-El-Barr, and F. Ashraf, “A Survey and Comparison of Wormhole Routing Techniques in Mesh Networks,” IEEE Network, vol. 11, no. 2, pp. 38-45, 1997.
[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] R. Boppana and S. Chalasani, "Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks," IEEE Trans. Computers, vol. 44, no. 7, pp. 848-864, July 1995.
[5] Y.M. Boura and C.R. Das, “Fault-Tolerant Routing in Mesh Networks,” Proc. Int'l Conf. Parallel Processing, pp. I-106-109, 1995.
[6] S. Chalasani and R. Boppana, “Communication in Multicomputers with Nonconvex Faults,” IEEE Trans. Computers, vol. 46, no. 5, pp. 616–622, May 1997.
[7] 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.
[8] W.J. Dally and C.L. Seitz, “The Torus Routing Chip,” J. Parallel and Distributed Computing, vol. 1, no. 3, pp. 187-196, 1986.
[9] J. Duato,"A Theory of Deadlock-Free Adaptive Multicast Routing in Wormhole Networks," Trans. Parallel and Distributed Systems, vol. 6, no. 9, Sept. 1995, pp. 976-987.
[10] K.-P. Fan and C.-T. King, “Turn Grouping for Efficient Multicast in wormhole Mesh Networks,” Proc. Symp. Frontiers of Massively Parallel Computation, pp. 50-57, 1996.
[11] 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.
[12] T.-Y. Juang, Y.-C. Tseng, and M.-H. Yang, “An Euler-Path-Based Multicasting Model for Wormhole-Routed Networks: Its Applications to Damaged 2D Tori and Meshes,” Proc. Int'l Performance, Computing, and Comm. Conf., pp. 444-450, 1997.
[13] R. Kesavan and D.K. Panda, “Minimizing Node Contention in Multiple Multicast on Wormholek-Aryn-Cube Networks,” Proc. Int'l Conf. Parallel Processing, vol. I, pp. 188-195, Aug. 1996.
[14] R. Hadas, K. Watkins, and T. Hehre, “Fault-Tolerant Multicast Routing in the Mesh with No Virtual Channels,” Proc. 1996 Int'l Symp. High-Performance Computer Architecture, pp. 180–190, 1996.
[15] 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.
[16] 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.
[17] D.K. Panda, S. Singal, and P. Prabhakaran, “Multidestination Message Passing Mechanism Conforming to Base Wormhole Routing Scheme,” Proc. Parallel Computer Routing and Comm. Workshop, pp. 131–145, 1994.
[18] W. Qiao and L.M. Ni, “Adaptive Routing in Irregular Networks Using Cut-Through Switches,” Proc. 1996 Int'l Conf. Parallel Processing, Aug. 1996.
[19] K.H. Rosen, Discrete Mathematics and its Applications, McGraw-Hill, New York, 1995.
[20] H. Schwetman, “Csim Users' Guide,” Technical Report ACT-126-90, MCC, year?
[21] J.-P. Sheu and M.-Y. Su, “A Multicast Algorithm for Hypercube Multiprocessors,” Proc. Int'l Conf. Parallel Processing, pp. III-18-22, 1992.
[22] 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.
[23] Y.C. Tseng, D.K. Panda, and T.H. Lai, "A Trip-Based Multicasting Model in Wormhole-Routed Networks with Virtual Channels," IEEE Trans. Parallel and Distributed Systems, Vol. 7, No. 2, Feb. 1996, pp.138-150.
[24] Y.-C. Tseng, M.-H. Yang, and T.-Y. Juang, “An Euler-Path-Based Multicasting Model for Wormhole-Routed Networks with Multi-Destination Capability,” Proc. Int'l Conf. Parallel Processing, pp. 366-373, 1998.

Index Terms:
Euler path, fault tolerance, mesh, multicast, multicomputer network, torus, virtual channel, wormhole routing.
Citation:
Yu-Chee Tseng, Ming-Hour Yang, Tong-Ying Juang, "Achieving Fault-Tolerant Multicast in Injured Wormhole-Routed Tori and Meshes Based on Euler Path Construction," IEEE Transactions on Computers, vol. 48, no. 11, pp. 1282-1296, Nov. 1999, doi:10.1109/12.811118
Usage of this product signifies your acceptance of the Terms of Use.