This Article 
 Bibliographic References 
 Add to: 
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
December 1993 (vol. 4 no. 12)
pp. 1320-1331

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.

[1] W. C. Athas and C. L. Seitz, "Multicomputers: Message-passing concurrent computers,"IEEE Comput. Mag., vol. 21, pp. 9-24, Aug. 1988.
[2] S. Borkar et al., "iWarp: An Integrated Solution to High Speed Parallel Computing,"Proc. Supercomputing 88, Vol. 1, CS Press, Los Alamitos, Calif., Order No. 882, pp. 330-339.
[3] W. Chou, A. W. Bragg, and A. A. Nilsson, "The need for adaptive routing in the chaotic and unbalanced traffic environment,"IEEE Trans. Commun., vol. COM-29, pp. 481-490, Apr. 1981.
[4] E. Chow, H. Madan, J. Peterson, D. Grunwald, and D. A. Reed, "Hyperswitch network for the hypercube computer," inProc. 15th Annu. Int. Symp. Comput. Architecture, May-June 1988.
[5] W. J. Dally,A VLSI Architecture for Concurrent Data Structures. Boston, MA: Kluwer Academic, 1987, pp. 144-161.
[6] W. J. Dally, "Virtual-channel flow control," inProc. 17th Annu. Int. Symp. Comput. Architecture, May 1990.
[7] W. J. Dally, "Performance analysis ofk-aryn-cube interconnection networks,"IEEE Trans. Comput., vol. 39, pp. 775-785, June 1990.
[8] W. J. Dally, "Virtual-channel flow control,"IEEE Trans. Parallel Distributed Syst., vol. 3, pp. 194-205, Mar. 1992.
[9] W. J. Dally and C. L. Seitz, "The torus routing chip,"Distributed Comput., vol. 1, pp. 187-196, Oct. 1986.
[10] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[11] J. Duato, "Deadlock-free adaptive routing algorithms for multicomputers,"Tech. et Sci. Informatiques, vol. 10, no. 4, 1991.
[12] J. Duato, "Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm," inProc. 3rd IEEE Int. Symp. Parallel Distributed Processing, Dec. 1991.
[13] D. Gelernter, "A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks,"IEEE Trans. Comput., vol. C-30, pp. 709-715, Oct. 1981.
[14] C. Germain-Renaud, "Etude des mécanismes de communication pour une machine massivement parallèle: MEGA," Ph.D. dissertation, Universitéde Paris-Sud, Centre d'Orsay, France, 1989.
[15] K. D. Gunther, "Prevention of deadlocks in packet-switched data transport systems,"IEEE Trans. Commun., vol. COM-29, no. 4, pp. 512-524, Apr. 1981.
[16] W. D. Hillis,The Connection Machine. Cambridge, MA: MIT Press, 1985.
[17] H. Hofestädt, A. Klein, and E. Reyzl, "Performance benefits from locally adaptive interval routing in dynamically switched interconnection networks," inProc. 2nd European Distributed Memory Comput. Conf., Apr. 1991.
[18] C. R. Jesshope, P. R. Miller, and J. T. Yantchev, "High performance communications in processor networks," inProc. 16th Annu. Int. Symp. Comput. Architecture, May-June 1989.
[19] P. Kermani and L. Kleinrock, "Virtual cut-through: A new computer communication switching technique,"Comput. Networks, vol. 3, pp. 267-286, 1979.
[20] C. K. Kim and D. A. Reed, "Adaptive packet routing in a hypercube," inProc. 3rd Conf. Hypercube Concurrent Comput. Appl., Jan. 1988.
[21] H.T. Kung, "Deadlock avoidance for systolic communication," inProc. 15th Annu. Int. Symp. Comput. Architecture, May-June 1988.
[22] D. H. Linder and J. C. Harden, "An adaptive and fault tolerant wormhole routing strategy fork-aryn-cubes,"IEEE Trans. Comput., vol. 40, pp. 2-12, Jan. 1991.
[23] P. M. Merlin and P. J. Schweitzer, "Deadlock avoidance in store-and-forward networks--I: Store-and-forward deadlock,"IEEE Trans. Commun., vol. COM-28, pp. 345-354, Mar. 1980.
[24] S. Ragupathy, M. R. Leutze, and S. R. Schach, "Message routing schemes in a hypercube machine," inProc. 3rd Conf. Hypercube Concurrent Comput. Appl., Jan. 1988.
[25] D. S. Reeves, E. F. Gehringer, and A. Chandiramani, "Adaptive routing and deadlock recovery: A simulation study," inProc. 4th Conf. Hypercube Concurrent Comput. Appl., Mar. 1989.

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
J. Duato, "A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 4, no. 12, pp. 1320-1331, Dec. 1993, doi:10.1109/71.250114
Usage of this product signifies your acceptance of the Terms of Use.