This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Message Flow Model for Routing in Wormhole-Routed Networks
July 1995 (vol. 6 no. 7)
pp. 755-760

Abstract—In this paper, we introduce a new approach to deadlock-free routing in wormhole-routed networks called the message flow model. This method may be used to develop deterministic, partially-adaptive, and fully-adaptive routing algorithms for wormhole-routed networks with arbitrary topologies. We first establish the necessary and sufficient condition for deadlock-free routing, based on the analysis of the message flow on each channel. We then use the model to develop new adaptive routing algorithms for 2D meshes.

[1] W.J. Dally and C.L. Seitz,“The torus routing chip,” J. Distributed Computing, vol. 1, no. 3, pp. 187-196, 1986.
[2] 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.
[3] 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.
[4] 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.
[5] J. Duato,“On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects,” Proc. Second Europe Distributed Memory Computing Conf., Apr. 1991.
[6] J. Duato, “On the Design of Deadlock-Free Adaptive Routing Algorithms for Multicomputers: Design Methodologies,” Proc. Parallel Architectures and Languages Europe 91, June 1991.
[7] X. Lin,P.K. McKinley,, and L.M. Ni,“The message flow model for routing in wormhole-routed networks,” Tech. Report, MSU-CPS-ACS-78, Michigan State Univ., Dec. 1992.
[8] W.J. Dally,“Virtual channel flow control,” IEEE Trans. Computers, vol. 3, pp. 194-205, Mar. 1992.
[9] W.J. Dally,“Fine-grain message passing concurrent computers,” Proc. Third Conf. Hypercube Concurrent Computers, vol. 1, pp. 2-12, Jan. 1988.
[10] H. Xu,P.K. McKinley,, and L.M. Ni,“Efficient implementation of barrier synchronization in wormhole-routed hypercube multicomputers,” J. Parallel and Distributed Computing, vol. 16, pp. 172-184, 1992.
[11] 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.
[12] W.J. Dally and H. Aoki,“Adaptive routing using virtual channels,” Tech. Report, Laboratory for Computer Science, MIT, Sept. 1990.
[13] X. Lin and L. Ni, "Deadlock-Free Multicast Wormhole Routing in Multicomputer Networks," Proc. Int'l Symp. Computer Architecture, June 1991.

Index Terms:
Channel dependency graph, message flow model, wormhole routing, multicast communication, mesh networks, deadlock-free routing, adaptive routing.
Citation:
Xiaola Lin, Philip K. McKinley, Lionel M. Ni, "The Message Flow Model for Routing in Wormhole-Routed Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 7, pp. 755-760, July 1995, doi:10.1109/71.395404
Usage of this product signifies your acceptance of the Terms of Use.