A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems

Volumn 6, Issue 10, 1995, Pages 1055-1067

  Duato, Jose ^a  

^a UNIVERSITAT POLITÈCNICA DE VALÈNCIA   (Spain)

Author keywords

Adaptive routing; computers; deadlock avoidance; multiwormhole; virtual channels

Indexed keywords

ADAPTIVE ALGORITHMS; BANDWIDTH; COMMUNICATION CHANNELS (INFORMATION THEORY); COMPUTER NETWORKS; COMPUTER SYSTEM RECOVERY; MULTIPROCESSING SYSTEMS; THEOREM PROVING;

ADAPTIVE ROUTING; DEADLOCK AVOIDANCE; ROUTING ALGORITHMS; VIRTUAL CHANNELS; WORMHOLE NETWORKS;

DATA COMMUNICATION SYSTEMS;

EID: 0029390484     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.473515     Document Type: Article

References (28)

1. W.C. Athas and C.L. Seitz, “Multicomputers: Message-passing concurrent computers,” Computer, vol. 21, no. 8, pp. 9-24, Aug. 1988.
2. P.E. Berman, L. Gravano, G.D. Pifarré, and J.L.C. Sanz, “Adaptive deadlock-and livelock-free routing with all minimal paths in torus networks,” Proc. Fourth ACM Symp. Parallel Algorithms Architectures, June 1992.
3. S. Borkar, R. Cohn, G. Cox, S. Gleason, T. Gross, H.T. Kung, M. Lam, B. Moore, C. Peterson, J. Pieper, L. Rankin, P.S. Tseng, J. Sutton, J. Urbanski, and J. Webb, “iWarp: An integrated solution to high-speed parallel computing,” Proc. Supercomputing '88, Nov. 1988.
4. A.A. Chien and J.H. Kim, “Planar-adaptive routing: Low-cost adaptive networks for multiprocessors,” Proc. 19th Ann. Int'l Symp. Comput. Architecture, May 1992.
5. A.A. Chien, “A cost and speed model for k-ary n-cube wormhole routers,” Proc. Hot Interconnects '93, 1993.
6. R. Cypher and L. Gravano, “Requirements for deadlock-free adaptive packet routing,” Proc. 11th ACM Symp. Principles Distributed Computing, 1992.
7. W.J. Dally and C.L. Seitz, “The torus routing chip,” Distributed Comput., vol. 1, no. 3, pp. 187-196, Oct. 1986.
8. W.J. Dally and C.L. Seitz, “Deadlock-free message routing in multiprocessor interconnection networks,” IEEE Trans. on Computers, vol. 36, no. 5, pp. 547-553, May 1987.
9. W.J. Dally, “Virtual-channel flow control,” IEEE Trans. on Parallel and Distributed Systems, vol. 3, no. 2, pp. 194-205, Mar. 1992.
10. W.J. Dally and H. Aoki, “Deadlock-free adaptive routing in multicomputer networks using virtual channels,” IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 4, pp. 466-475, Apr. 1993.
11. J. Duato, “On the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies,” Proc. Parallel Architectures Languages Europe '91, June 1991.
12. J. Duato, “Deadlock-free adaptive routing algorithms for multicomputers: Evaluation of a new algorithm,” Proc. Third IEEE Int'l Symp. Parallel Distributed Processing, Dec. 1991.
13. J. Duato, “A new theory of deadlock-free adaptive multicast routing in wormhole networks,” Proc. Fifth IEEE Int'l Symp. Parallel Distributed Processing, Dec. 1993.
14. J. Duato, “A new theory of deadlock-free adaptive routing in wormhole networks,” IEEE Trans. on Parallel and Distributed Systems, vol. 4, no. 12, pp. 1,320-1,331, Dec. 1993.
15. J. Duato and P. López, “Performance evaluation of adaptive routing algorithms for k-ary n-cubes,” Proc. Parallel Computer Routing and Communication Workshop, May 1994.
16. J. Duato, “A theory to increase the effective redundancy in wormhole networks,” Parallel Processing Letters, vol. 4, no. 1 & 2, pp. 125-138, 1994.
17. P.T. Gaughan and S. Yalamanchili, “Adaptive routing protocols for hypercube interconnection networks,” Computer, vol. 26, no. 5, pp. 12-23, May 1993.
18. C.J. Glass and L.M. Ni, “The turn model for adaptive routing,” Proc. 19th Ann. Int'l Symp. Comput. Architecture, May 1992.
19. C.J. Glass and L.M. Ni, “Maximally fully adaptive routing in 2D meshes,” Proc. Int'l Conf. Parallel Processing, Aug. 1992.
20. C.R. Jesshope, P.R. Miller, and J.T. Yantchev, “High performance communications in processor networks,” Proc. 16th Ann. Int'l Symp. Comput. Architecture, May-June 1989.
21. H.T. Kung, “Deadlock avoidance for systolic communication,” Proc. 15th Ann. Int'l Symp. Comput. Architecture, May-June 1988.
22. X. Lin and L.M. Ni, “Deadlock-free multicast wormhole routing in multicomputer networks,” Proc. 18th Ann. Int'l Symp. Comput. Architecture, May 1991.
23. X. Lin, P.K. McKinley, and L.M. Ni, “The message flow model for routing in wormhole-routed networks,” Proc. 1993 Int'l Conf. Parallel Processing, Aug. 1993.
24. D.H. Linder and J.C. Harden, “An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes,” IEEE Trans. on Computers, vol. 40, no. 1, pp. 2-12, Jan. 1991.
25. Z. Liu and H. Wu, “Performance evaluation of adaptive wormhole routing in 3D mesh networks,” Proc. 26th Ann. Simulation Symp., 1993.
26. Z. Liu, J. Duato, and L.-E. Thorelli, “Grouping virtual channels for deadlock-free adaptive wormhole routing,” Proc. Parallel Architectures Languages Europe 93, June 1993.
27. P. Lopez and J. Duato, “Deadlock-free adaptive routing algorithms for the 3D-torus: Limitations and solutions,” Proc. Parallel Architectures Languages Europe 93, June 1993.
28. L.M. Ni and P.K. McKinley, “A survey of wormhole routing techniques in direct networks,” Computer, vol. 26, no. 2, pp. 62-76, Feb. 1993.