Requirements for deadlock-free, adaptive packet routing

This paper studies the problem of deadlock-free packet routing in parallel and distributed architectures. We present three main results. First, we show that the standard technique of ordering the queues so that every packet always has the possibility of moving to a higher ordered queue is not necessary for deadlock-freedom. Second, we show that every deadlock-free, adaptive packet routing algorithm can be restricted, by limiting the adaptivity available, to obtain an oblivious algorithm which is also deadlock-free. Third, we show that any packet routing algorithm for a cycle or torus network which is free of deadlock and which uses only minimal length paths must require at least three queues in some node. This matches the known upper bound of three queues per node for deadlock-free, minimal packet routing on cycle and torus networks.

[1]  Paul J. Schweitzer,et al.  Deadlock Avoidance in Store-And-Forward Networks , 1978, Jerusalem Conference on Information Technology.

[2]  Luis Gravano,et al.  Adaptive deadlock- and livelock-free routing with all minimal paths in Torus networks , 1992, SPAA '92.

[3]  Smaragda Konstantinidou,et al.  Adaptive, minimal routing in hypercubes , 1990 .

[4]  Moti Yung,et al.  Principle for high speed network control: congestion-and deadlock-freeness, self-routing, and a single buffer per link , 1990, PODC '90.

[5]  Lawrence Snyder,et al.  The chaos router: a practical application of randomization in network routing , 1990, SPAA '90.

[6]  José Duato.  Deadlock-free adaptive routing algorithms for multicomputers: evaluation of a new algorithm , 1991, Proceedings of the Third IEEE Symposium on Parallel and Distributed Processing.

[7]  Luis Gravano,et al.  Fully-adaptive minimal deadlock-free packet routing in hypercubes, meshes, and other networks , 1991, SPAA '91.

[8]  Boaz Patt-Shamir,et al.  Greedy Packet Scheduling on Shortest Paths , 1993, J. Algorithms.

[9]  Boaz Patt-Shamir,et al.  Greedy packet scheduling on shortest paths (preliminary version) , 1991, PODC '91.

[10]  Inder S. Gopal.  Prevention of Store-and-Forward Deadlock in Computer Networks , 1985, IEEE Trans. Commun..

[11]  Chris R. Jesshope,et al.  High Performance Communications In Processor Networks , 1989, The 16th Annual International Symposium on Computer Architecture.

[12]  Kenneth Steiglitz,et al.  Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks , 1981, SIAM J. Comput..

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

[14]  Chris R. Jesshope,et al.  Adaptive, low latency, deadlock-free packet routing for networks of processors , 1989 .

[15]  Baruch Awerbuch,et al.  Efficient deadlock-free routing , 1991, PODC '91.

[16]  Jeffrey D. Ullman,et al.  Deadlock-Free Packet Switching Networks , 1981, SIAM J. Comput..

[17]  Andrew A. Chien,et al.  Planar-adaptive routing: low-cost adaptive networks for multiprocessors , 1992, ISCA '92.

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

[19]  Luis Gravano,et al.  Adaptive, Deadlock-Free Packet Routing in Torus Networks with Minimal Storage , 1992, ICPP.

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