A General Theory for Deadlock-Free Adaptive Routing Using a Mixed Set of Resources

This paper presents a theoretical framework for the design of deadlock-free fully adaptive routing algorithms for a general class of network topologies and switching techniques in a single, unified theory. A general theory is proposed that allows the design of deadlock avoidance-based as well as deadlock recovery-based wormhole and virtual cut-through adaptive routing algorithms that use a homogeneous or a heterogeneous (mixed) set of resources. The theory also allows channel queues to be allocated nonatomically, utilizing resources efficiently. A general methodology for the design of fully adaptive routing algorithms applicable to arbitrary network topologies is also proposed. The proposed theory and methodology allow the design of efficient network routers that require minimal resources for handling infrequent deadlocks.

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

[2]  William J. Dally,et al.  A Delay Model for Router Microarchitectures , 2001, IEEE Micro.

[3]  Xiaola Lin,et al.  Multicast Communication in Multicomputer Networks , 1993, ICPP.

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

[5]  William J. Dally.  Virtual-Channel Flow Control , 1992, IEEE Trans. Parallel Distributed Syst..

[6]  José Duato,et al.  A Necessary and Sufficient Condition for Deadlock-Free Routing in Cut-Through and Store-and-Forward Networks , 1996, IEEE Trans. Parallel Distributed Syst..

[7]  Timothy Mark Pinkston,et al.  An efficient, fully adaptive deadlock recovery scheme: DISHA , 1995, ISCA.

[8]  Mike Galles.  Spider: a high-speed network interconnect , 1997, IEEE Micro.

[9]  Daniel H. Linder,et al.  An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-Ary n-Cubes , 1994, IEEE Trans. Computers.

[10]  C. R. Jesshope,et al.  High performance communications in processor networks , 1989, ISCA '89.

[11]  Timothy Mark Pinkston,et al.  Characterization of deadlocks in irregular networks , 1999, Proceedings of the 1999 International Conference on Parallel Processing.

[12]  Federico Silla,et al.  On the Use of Virtual Channels in Networks of Workstations with Irregular Topology , 2000, IEEE Trans. Parallel Distributed Syst..

[13]  William J. Dally,et al.  Architecture and implementation of the reliable router , 1994, Symposium Record Hot Interconnects II.

[14]  Timothy Mark Pinkston.  Flexible and Efficient Routing Based on Progressive Deadlock Recovery , 1999, IEEE Trans. Computers.

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

[16]  D. Lenoski,et al.  The SGI Origin: A ccnuma Highly Scalable Server , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.

[17]  Xiaola Lin,et al.  The Message Flow Model for Routing in Wormhole-Routed Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[18]  S. Konstantinidou,et al.  Chaos router: architecture and performance , 1991, [1991] Proceedings. The 18th Annual International Symposium on Computer Architecture.

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

[20]  T.M. Pinkston,et al.  On Deadlocks In Interconnection Networks , 1997, Conference Proceedings. The 24th Annual International Symposium on Computer Architecture.

[21]  Timothy Mark Pinkston,et al.  DISHA: a deadlock recovery scheme for fully adaptive routing , 1995, Proceedings of 9th International Parallel Processing Symposium.

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

[23]  James R. Goodman,et al.  The Impact of Pipelined Channels on k-ary n-Cube Networks , 1994, IEEE Trans. Parallel Distributed Syst..

[24]  William J. Dally,et al.  Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels , 1993, IEEE Trans. Parallel Distributed Syst..

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

[26]  Bülent Abali,et al.  A Deadlock Avoidance Method for Computer Networks , 1997, CANPC.

[27]  Dennis G. Shea,et al.  The SP2 High-Performance Switch , 1995, IBM Syst. J..

[28]  Lionel M. Ni,et al.  Adaptive routing in irregular networks using cut-through switches , 1996, Proceedings of the 1996 ICPP Workshop on Challenges for Parallel Processing.

[29]  Fabrizio Petrini,et al.  Performance analysis of minimal adaptive wormhole routing with time-dependent deadlock recovery , 1997, Proceedings 11th International Parallel Processing Symposium.

[30]  Pedro López,et al.  A very efficient distributed deadlock detection mechanism for wormhole networks , 1998, Proceedings 1998 Fourth International Symposium on High-Performance Computer Architecture.

[31]  José Duato,et al.  A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks , 1993, IEEE Trans. Parallel Distributed Syst..

[32]  Sudhakar Yalamanchili,et al.  A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[33]  Yuval Tamir,et al.  Dynamically-Allocated Multi-Queue Buffers for VLSI Communication Switches , 1992, IEEE Trans. Computers.

[34]  G.D. Pifarre,et al.  Fully Adaptive Minimal Deadlock-Free Packet Routing in Hypercubes, Meshes, and other Networks: Algorithms and Simulations , 1994, IEEE Trans. Parallel Distributed Syst..

[35]  Carmen Carrión,et al.  A flow control mechanism to avoid message deadlock in k-ary n-cube networks , 1997, Proceedings Fourth International Conference on High-Performance Computing.

[36]  Pedro López,et al.  Software-based deadlock recovery technique for true fully adaptive routing in wormhole networks , 1997, Proceedings of the 1997 International Conference on Parallel Processing (Cat. No.97TB100162).

[37]  Steven L. Scott,et al.  Optimized Routing in the Cray T3D , 1994, PCRCW.

[38]  Loren Schwiebert,et al.  A Necessary and Sufficient Condition for Deadlock-Free Wormhole Routing , 1996, J. Parallel Distributed Comput..

[39]  Robert W. Horst,et al.  ServerNet deadlock avoidance and fractahedral topologies , 1996, Proceedings of International Conference on Parallel Processing.

[40]  Timothy Mark Pinkston,et al.  A Formal Model of Message Blocking and Deadlock Resolution in Interconnection Networks , 2000, IEEE Trans. Parallel Distributed Syst..

[41]  Timothy Mark Pinkston,et al.  Characterization of Deadlocks in k-ary n-Cube Networks , 1999, IEEE Trans. Parallel Distributed Syst..

[42]  José Duato,et al.  Generalized theory for deadlock-free adaptive wormhole routing and its application to Disha Concurrent , 1996, Proceedings of International Conference on Parallel Processing.

[43]  Timothy Mark Pinkston,et al.  Design issues for core-based optoelectronic chips: a case study of the WARRP network router , 1999 .

[44]  Paolo Palazzari,et al.  An adaptive deadlock and livelock free routing algorithm , 1995, Proceedings Euromicro Workshop on Parallel and Distributed Processing.

[45]  Andrew A. Chien,et al.  Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing , 1997, IEEE Trans. Parallel Distributed Syst..

[46]  José Duato.  A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks , 1995, IEEE Trans. Parallel Distributed Syst..

[47]  Paolo Palazzari,et al.  Virtual cut-through implementation of the HB packet switching routing algorithm , 1998, Proceedings of the Sixth Euromicro Workshop on Parallel and Distributed Processing - PDP '98 -.

[48]  Michael Burrows,et al.  Autonet: A High-Speed, Self-Configuring Local Area Network Using Point-to-Point Links , 1991, IEEE J. Sel. Areas Commun..

[49]  Loren Schwiebert,et al.  A universal proof technique for deadlock-free routing in interconnection networks , 1995, SPAA '95.

[50]  Antonio Robles,et al.  Efficient Adaptive Routing in Networks of Workstations with Irregular Topology , 1997, CANPC.

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

[52]  Steven L. Scott,et al.  The Cray T3E Network: Adaptive Routing in a High Performance 3D Torus , 1996 .