A necessary and sufficient condition for deadlock-free wormhole routing

Journal of Parallel and Distributed Computing

Volumn 32, Issue 1, 1996, Pages 103-117

  Schwiebert, Loren ^a   Jayasimha, D N ^a  

^a OHIO STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030577564     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1006/jpdc.1996.0008     Document Type: Article

References (30)

1. 1. P. Berman, L. Gravano, G. Pifarré, and J. Sanz, Adaptive deadlock-and livelock-free routing with all minimal paths in torus networks. In 4th Annual ACM Symposium on Parallel Algorithms and Architectures, 1992, pp. 3-12.
2. 2. Y. M. Boura and C. R. Das, A class of partially adaptive routing algorithms for n-dimensional meshes. In International Conference on Parallel Processing, 1993, Vol. III, pp. 175-182.
3. 3. A. A. Chien, A cost and speed model for k-ary n-cube wormhole routers. In Hot Interconnects '93, Aug. 1993.
4. 4. A. A. Chien and J. H. Kim, Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. In 19th Annual International Symposium on Computer Architecture, 1992, pp. 268-277.
5. 5. R. Cypher and L. Gravano, Requirements for deadlock-free, adaptive packet routing. SIAM J. Comput. 23(6), 1266-1274 (Dec. 1994).
6. 6. W. J. Dally, Fine-grain message-passing concurrent computers. In Proceedings of the Third Conference on Hypercube Concurrent Computers, 1988, Vol. 1, pp. 2-12.
7. 7. W. J. Dally, Virtual-channel flow control. IEEE Trans. Parallel Distrib. Systems 3(2), 194-205 (Mar. 1992).
8. 8. W. J. Dally and H. Aoki, Deadlock-free adaptive routing in multicomputer networks using virtual channels. IEEE Trans. Parallel Distrib. Systems 4(4), 466-475 (Apr. 1993).
9. 9. W. J. Dally and C. L. Seitz, Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36(5), 547-553 (May 1987).
10. 10. J. T. Draper and J. Ghosh, Multipath e-cube algorithms (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes. In International Parallel Processing Symposium, 1992, pp. 407-410.
11. 11. J. Duato, On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies. In Parallel Architectures and Languages Europe 91, 1991, Vol. I, pp. 390-405.
12. 12. J. Duato, A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. Technical report, Universidad Politecnica de Valencia, 1993.
13. 13. J. Duato, A new teheory of deadlock-free adaptive routing in wormhole networks, IEEE Trans. Parallel Distrib. Systems 4(12), 1320-1331 (Dec. 1993).
14. 14. J. Duato, A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks. In International Conference on Parallel Processing, 1994, Vol. I, pp. 142-149.
15. 15. P. T. Gaughan and S. Yalamanchili, Adaptive routing protocols for hypercube interconnection networks. IEEE Comput. 26(5), 12-23 (May 1993).
16. 16. C. Glass and L. M. Ni, Adaptive routing in mesh-connected networks. In 12th International Conference on Distributed Computing Systems, 1992, pp. 12-19.
17. 17. C. Glass and L. M. Ni, Maximally fully adaptive routing in 2D meshes. In International Conference on Parallel Processing, 1992, Vol. I, pp. 101-104.
18. 18. C. Glass and L. M. Ni, The turn model for adaptive routing. In 19th Annual International Symposium on Computer Architecture, 1992, pp. 278-287.
19. 19. C. Glass and L. M. Ni, The turn model for adaptive routing. J. Assoc. Comput. Mach. 41(5), 874-902 (Sep. 1994).
20. 20. L. Gravano, G. Pifarré, G. Denicolay, and J. Sanz, Adaptive deadlock-free worm-hole routing in hypercubes. In International Parallel Processing Symposium, 1992, pp. 512-515.
21. 21. C. R. Jesshope, P. R. Miller, and J. T. Yantchev, High performance communications in processor networks. In 16th Annual International Symposium on Computer Architecture, 1989, pp. 150-157.
22. 22. Q. Li, Minimum deadlock-free message routing restrictions in binary hypercubes. J. Parallel Distrib. Comput. 15(2), 153-159 (June 1992).
23. 23. X. Lin, P. K. McKinley, and L. M. Ni, The message flow model for routing in wormhole-routed networks. In International Conference on Parallel Processing, 1993, Vol. I, pp. 294-297.
24. 24. D. H. Linder and J. C. Harden, An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Trans. Comput. 40(1), 2-12 (Jan. 1991).
25. 25. J. May, D. N. Jayasimha, and K. Patel, Comparison of multiplexing schemes for wormhole-routed distributed memory multiprocessors. In 1st International Workshop on Parallel Processing, 1994, pp. 211-215.
26. 26. L. M. Ni and P. K. McKinley, A survey of wormhole routing techniques in direct networks. IEEE Comput. 26(2), 62-76 (Feb. 1993).
27. 27. L. Schwiebert and D. N. Jayasimha, Optimal fully adaptive wormhole routing for meshes. In Supercomputing '93, pp. 782-791.
28. 28. L. Schwiebert and D. N. Jayasimha, Optimal fully adaptive minimal wormhole routing for meshes. J. Parallel Distrib. Comput. 27(1), 56-70 (May 1995).
29. 29. C.-C. Su and K. G. Shin, Adaptive deadlock-free routing in multicomputers using only One Extra Virtual Channel. In International Conference on Parallel Processing, 1993, Vol. I, pp. 227-231.
30. 30. C. S. Yang and Y. M. Tsai, Fault-tolerant and deadlock-free wormhole routing in the hypercube network. In International Conference on Parallel and Distributed Systems, 1992, pp. 9-16.