This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Layered Routing in Irregular Networks
January 2006 (vol. 17 no. 1)
pp. 51-65

Abstract—Freedom from deadlock is a key issue in Cut-Through, Wormhole, and Store and Forward networks, and such freedom is usually obtained through careful design of the routing algorithm. Most existing deadlock-free routing methods for irregular topologies do, however, impose severe limitations on the available routing paths. We present a method called Layered Routing, which gives rise to a series of routing algorithms, some of which perform considerably better than previous ones. Our method groups virtual channels into network layers and to each layer it assigns a limited set of source/destination address pairs. This separation of traffic yields a significant increase in routing efficiency. We show how the method can be used to improve the performance of irregular networks, both through load balancing and by guaranteeing shortest-path routing. The method is simple to implement, and its application does not require any features in the switches other than the existence of a modest number of virtual channels. The performance of the approach is evaluated through extensive experiments within three classes of technologies. These experiments reveal a need for virtual channels as well as an improvement in throughput for each technology class.

[1] K.V. Anjan and T.M. Pinkston, “An Efficient, Fully Adaptive Deadlock Recovery Scheme: DISHA,” Proc. Int'l Symp. Computer Architecture-95, pp. 201-210, 1995.
[2] ASI-SIG, “Advanced Switching Core Architecture Specification,” http:/www.asi-sig.org/, 2004.
[3] N.J. Boden, D. Cohen, R.E. Felderman, A.E. Kulawik, C.L. Seitz, J.N. Seizovic, and W.-K. Su, “Myrinet— A Gigabit-per-Second Local-Area Network,” IEEE Micro, 1995.
[4] W.J. Dally, “Scalable Switching Fabrics for Internet Routers,” Avici Systems Inc. White Paper, 2004.
[5] W.J. Dally and C.L. Seitz, “Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,” IEEE Trans. Computers, vol. 36, no. 5, pp. 547-553, May 1987.
[6] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 6, no. 10, pp. 1055-1067, Oct. 1995.
[7] J. Duato, “A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 7, no. 8, pp. 841-854, Aug. 1996.
[8] J. Duato and T.M. Pinkston, “A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources,” IEEE Trans. Parallel and Distributed Systems, vol. 12, no. 12, pp. 1219-1235, Dec. 2001.
[9] J. Flich, M.P. Malumbres, P. López, and J. Duato, “Performance Evaluation of a New Routing Strategy for Irregular Networks,” Proc. 2000 Int'l Conf. Supercomputing (ICS), pp. 34-43, 2000.
[10] J. Flich, P. López, M.P. Malumbres, and J. Duato, “Boosting the Performance of Myrinet Networks,” IEEE Trans. Parallel and Distributed Systems, vol. 13, no. 7, pp. 693-709, July 2002.
[11] R.W. Horst, “Tnet: A Reliable System Area Network,” IEEE Micro, vol. 15, no. 1, pp. 37-45, 1995.
[12] InfiniBand™ Architecture Specification, InfiniBand™ Trade Assoc., 2005.
[13] D.H. Linder and J.C. Harden, “An Adaptive and Fault Tolerant Wormhole Routing Strategy for $k{\hbox{-}}{\rm{Ary}}$ $n{\hbox{-}}{\rm{Cubes}}$ ,” IEEE Trans. Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
[14] Z. Liu and A.A. Chien, “Hierarchical Adaptive Routing: A Framework for Fully Adaptive and Deadlock-Free Wormhole Routing,” Proc. Sixth Symp. Parallel and Distributed Processing, pp. 688-695, 1994.
[15] O. Lysne and T. Skeie, “Load Balancing of Irregular System Area Networks through Multiple Roots,” Proc. Second Int'l Conf. Comm. in Computing (CIC 2001), 2001.
[16] M.D. Schroeder et al., “Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links,” SRC Research Report 59, Digital Equipment Corp., 1990.
[17] R. Perlman, “An Algorithm for Distributed Computation of a Spanning Tree in an Extended LAN,” Proc. Ninth Data Comm. Symp., pp. 44-53, 1985.
[18] W. Qiao and L.M. Ni, “Adaptive Routing in Irregular Networks Using Cut-Through Switches,” Proc. 1996 Int'l Conf. Parallel Processing (ICPP '96), pp. 52-60, 1996.
[19] J.C. Sancho, A. Robles, and J. Duato, “An Effective Methodology to Improve the Performance of the Up*/Down* Routing Algorithm,” IEEE Trans. Parallel and Distributed Systems, vol. 15, 2004.
[20] J.C. Sancho and A. Robles, “Improving Minimal Adaptive Routing in Networks with Irregular Topology,” Proc. 13th Int'l Conf. Parallel and Distributed Computing Systems (PDCS '00), 2000.
[21] J.C. Sancho, A. Robles, J. Flich, P. Lopez, and J. Duato, “Effective Methodology for Deadlock-Free Minimal Routing in Infiniband Networks,” Proc. Int'l Conf. Parallel Processing, pp. 409-418, Aug. 2002.
[22] F. Silla and J. Duato, “On the Use of Virtual Channels in Networks of Workstations with Irregular Topology,” Proc. 1997 Parallel Computing, Routing and Comm. Workshop, 1997.
[23] F. Silla and J. Duato, “High-Performance Routing in Networks of Workstations with Irregular Topology,” IEEE Trans. Parallel and Distributed Systems, vol. 11, no. 7, pp. 699-719, July 2000.
[24] F. Silla, J. Duato, A. Sivasubramaniam, and C.R. Das, “Virtual Channel Multiplexing in Networks of Workstations with Irregular Topology,” Proc. Fifth Int'l Conf. High Performance Computing, pp. 147-154, 1998.
[25] T. Skeie, O. Lysne, and I. Theiss, “Layered Shortest Path (LASH) Routing in Irregular System Area Networks,” Proc. Int'l Parallel and Distributed Processing Symp. (IPDPS), Apr. 2002.

Index Terms:
Routing functions, interprocessor communication, deadlock avoidance, irregular topologies.
Citation:
Olav Lysne, Tor Skeie, Sven-Arne Reinemo, Ingebj? Theiss, "Layered Routing in Irregular Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 17, no. 1, pp. 51-65, Jan. 2006, doi:10.1109/TPDS.2006.12
Usage of this product signifies your acceptance of the Terms of Use.