Deadlock avoidance for switches based on wormhole networks

We consider the use of wormhole routed networks as internal interconnects of switches. The interconnection of two wormhole networks that are free from deadlocks does not necessarily produce a deadlock free network. This is problematic when wormhole networks are used as switch-internal fabrics, because it severely restricts the possibilities for coupling the switches together. This paper presents a theory that can be effectively used to control this phenomenon caused by aggregated dependencies. We show that all aggregated dependencies can be removed from wormhole networks by careful inclusion of a limited number of virtual channels.

[1]  Lionel M. Ni,et al.  Switches and switch interconnects , 1997, Proceedings of the Fourth International Conference on Massively Parallel Processing Using Optical Interconnections.

[2]  Charles Clos,et al.  A study of non-blocking switching networks , 1953 .

[3]  Pierre Fraigniaud,et al.  A General Theory for Deadlock Avoidance in Wormhole-Routed Networks , 1998, IEEE Trans. Parallel Distributed Syst..

[4]  Riccardo Melen,et al.  Optimal cost/performance design of ATM switches , 1993, TNET.

[5]  DAVID GELERNTER.  A DAG-Based Algorithm for Prevention of Store-and-Forward Deadlock in Packet Networks , 1981, IEEE Transactions on Computers.

[6]  Lionel M. Ni,et al.  Design of scalable and multicast capable cut-through switches for high-speed LANs , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[7]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[8]  José Duato,et al.  994 International Conference on Parallel Processing a Necessary and Sufficient Condition for Deadlock-free Adaptive Routing in Wormhole Networks , 2022 .

[9]  Robert W. Horst.  TNet: A Reliable System Area Network , 1995, IEEE Micro.

[10]  Charles L. Seitz,et al.  Myrinet: A Gigabit-per-Second Local Area Network , 1995, IEEE Micro.

[11]  Lionel M. Ni,et al.  Design of a Scalable IP Router , 1997 .

[12]  P. Merlin,et al.  Deadlock Avoidance in Store-and-Forward Networks - I: Store-and-Forward Deadlock , 1980, IEEE Transactions on Communications.

[13]  Sudhakar Yalamanchili,et al.  Interconnection Networks: An Engineering Approach , 2002 .

[14]  K. Gunther,et al.  Prevention of Deadlocks in Packet-Switched Data Transport Systems , 1981 .

[15]  William J. Dally,et al.  Deadlock-Free Message Routing in Multiprocessor Interconnection Networks , 1987, IEEE Transactions on Computers.

[16]  Olav Lysne,et al.  Switched SCI Systems , 1998 .

[17]  Olav Lysne,et al.  Scalable Non-Blocking Networks with Fixed Size Routers , 1997, PDPTA.