Deadlock Resolution in Networks Employing Connection-Based Adaptive Routing

Adaptive routing is used in networks in order to achieve fault tolerance and optimize performance for all traffic patterns. Most adaptive routing schemes route each packet independently, requiring addressing and sequencing information to be transmitted and processed for each packet. Connection-based message transport, such as virtual circuits, reduces the overhead for routing packets through the network and maintain FIFO packets delivery. Dynamic Virtual Circuits (DVCs) combine the advantages of adaptive routing and connection-based message transport. When used with arbitrary topologies and without restricting the routes of packets, networks employing DVCs are susceptible to deadlocks. In this paper we investigate a scheme for resolving such deadlocks. The scheme takes into account dependencies introduced by the DVC mechanism as well as the inherent dependencies among packet buffers at the input ports of each switch. Detailed simulations of the scheme have been performed using a multi-threaded eventdriven simulator. Preliminary performance results are presented.

[1]  Israel Cidon,et al.  Local Distributed Deadlock Detection by Cycle Detection and Clusterng , 1987, IEEE Transactions on Software Engineering.

[2]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[3]  William D. Tajibnapis,et al.  A correctness proof of a topology information maintenance protocol for a distributed computer network , 1977, CACM.

[4]  Dirk Grunwald,et al.  Hyperswitch network for the hypercube computer , 1988, ISCA '88.

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

[6]  C. Q. Lee,et al.  The Computer Journal , 1958, Nature.

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

[8]  Jan van Leeuwen,et al.  Interval Routing , 1987, Computer/law journal.

[9]  Richard M. Fujimoto,et al.  Multicomputer Networks: Message-Based Parallel Processing , 1987 .

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

[11]  Luis Gravano,et al.  Routing techniques for massively parallel communication , 1991, Proc. IEEE.

[12]  Charles L. Seitz,et al.  A framework for adaptive routing in multicomputer networks , 1989, CARN.

[13]  Yuval Tamir,et al.  High-Performance Adaptive Routing in Multicomputers Using Dynamic Virtual Circuits , 1991, The Sixth Distributed Memory Computing Conference, 1991. Proceedings.