A New Method for Deadlock Elimination in Computer Networks With Irregular Toplologies

* This work has been supported by NSF grant MIP-9630096 Abstract In this paper we consider the problem of deadlock-free wormhole unicast routing in networks with irregular topologies. To prevent deadlocks, for each router some input/output pairs (turns) have to be prohibited. We analyze the problem of minimizing the number of prohibited turns for providing deadlock-free routing. A new algorithm is proposed, which guarantees that this number does not exceed 1/3 of the total number of turns and that it is still possible to send messages between any two initially connected nodes. To the best of our knowledge this is the first meaningful upper bound on the fraction of turns to be prohibited to prevent deadlocks for networks with an irregular toplogy. Also, the problem of routing in the presence of prohibited turns is considered and appropriate methods developed.

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

[2]  Suresh Chalasani,et al.  A comparison of adaptive wormhole routing algorithms , 1993, ISCA '93.

[3]  Kang G. Shin,et al.  A Router Architecture for Flexible Routing and Switching in Multihop Point-To-Point Networks , 1999, IEEE Trans. Parallel Distributed Syst..

[4]  Ran Libeskind-Hadas,et al.  Tree-based multicasting in wormhole-routed irregular topologies , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[5]  Lionel M. Ni,et al.  A survey of wormhole routing techniques in direct networks , 1993, Computer.

[6]  Mark G. Karpovsky,et al.  Fault-tolerant Message Routing in Computer Networks , 1999, PDPTA.

[7]  C.M. Cunningham,et al.  Fault-tolerant adaptive routing for two-dimensional meshes , 1995, Proceedings of 1995 1st IEEE Symposium on High Performance Computer Architecture.

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

[9]  Mark G. Karpovsky,et al.  Fault-Tolerant Message Routing for Multiprocessors , 1998, IPPS/SPDP Workshops.

[10]  Jehoshua Bruck,et al.  Fault-tolerant switched local area networks , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

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

[12]  Lionel M. Ni,et al.  The Turn Model for Adaptive Routing , 1992, [1992] Proceedings the 19th Annual International Symposium on Computer Architecture.

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

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

[15]  Ran Libeskind-Hadas,et al.  Optimal contention-free unicast-based multicasting in switch-based networks of workstations , 1998, Proceedings of the First Merged International Parallel Processing Symposium and Symposium on Parallel and Distributed Processing.

[16]  Suresh Chalasani,et al.  Communication in Multicomputers with Nonconvex Faults , 1995, IEEE Trans. Computers.

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

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