A deadlock-free routing control algorithm for torus network based ATM switches

Tightly coupled multicomputer networks offer an alternative approach to building large asynchronous transfer mode (ATM) switches for broadband networks. Among them multidimensional tori are the most popular topologies in use today among high performance multicomputers. Communication deadlock and its avoidance are critical issues in routing control algorithms for such networks. A new routing algorithm is proposed that is provably deadlock-free. It is also provably fair in allowing all nodes in the network to source and receive traffic. The algorithm is efficient in the use of the network and should therefore be able to perform well even under heavy and bursty traffic conditions.<
>