Issue No. 12 - December (1993 vol. 4)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/71.250114
<p>The theoretical background for the design of deadlock-free adaptive routing algorithmsfor wormhole networks is developed. The author proposes some basic definitions and twotheorems. These create the conditions to verify that an adaptive algorithm isdeadlock-free, even when there are cycles in the channel dependency graph. Two designmethodologies are also proposed. The first supplies algorithms with a high degree offreedom, without increasing the number of physical channels. The second methodology isintended for the design of fault-tolerant algorithms. Some examples are given to show theapplication of the methodologies. Simulations show the performance improvement thatcan be achieved by designing the routing algorithms with the new theory.</p>
Index Termsdeadlock-free adaptive routing; wormhole networks; adaptive algorithm; channeldependency graph; fault-tolerant algorithms; performance; routing algorithms;concurrency control; fault tolerant computing; graph theory; message passing;telecommunication network routing
J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," in IEEE Transactions on Parallel & Distributed Systems, vol. 4, no. , pp. 1320-1331, 1993.