The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.12 - December (1993 vol.4)
pp: 1320-1331
ABSTRACT
<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 TERMS
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
CITATION
J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks", IEEE Transactions on Parallel & Distributed Systems, vol.4, no. 12, pp. 1320-1331, December 1993, doi:10.1109/71.250114
23 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool