A foundation for designing deadlock-free routing algorithms in wormhole networks

Journal of the ACM

Volumn 50, Issue 2, 2003, Pages 250-275

  Jayasimha, D N ^a   Schwiebert, Loren ^b,e   Manivannan, D ^c,f   May, Jeff A ^d  

^a INTEL CORPORATION   (United States)

^b WAYNE STATE UNIVERSITY   (United States)

^c UNIVERSITY OF KENTUCKY   (United States)

^d James Gregory Associates Inc   (United States)

^e Wayne State University   (United States)

^f UNIVERSITY OF KENTUCKY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

CHANNEL WAITING; UNICAST; WORMHOLE NETWORKS;

ALGORITHMS; COMMUNICATION SYSTEMS; COMPUTER ARCHITECTURE; MULTICASTING; ROUTERS; THEOREM PROVING;

COMPUTER SYSTEM RECOVERY;

EID: 4243189285     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/636865.636869     Document Type: Article

References (35)

1. BALA, V., BRUCK, J., CYPHER, R., ELUSTONDO, P., HO, A., HO, C. T., KIPNIS, S., AND SNIR M. 1995. CCL: A portable and tunable collective communication library for scalable parallel computers. IEEE Trans. Parall. Dist. Syst. 6, 2, 154-164.
2. BARNETT, M., GUPTA, S., PAYNE, G., SHULER, L., VAN DEGEIJN, R., AND WATTS, J. 1994. Interprocessor collective communication library (InterCom). In IEEE Proceedings of the Scalable High-Performance Computing Conference. IEEE Computer Society Press, Los Alamitos, Calif., 357-364.
3. BOURA, Y. M., AND DAS, C. R. 1993. A class of partially adaptive routing algorithms for n-dimensional meshes. In Proceedings of the International Conference on Parallel Processing, volume III, 175-182.
4. CHIEN, A. A., AND KIM, J. H. 1992. Planar-adaptive routing: Low-cost adaptive networks for multiprocessors. In Proceedings of the 19th Annual International Symposium on Computer Architecture, 268-277.
5. CYPHER, R., AND GRAVANO, L. 1994. Requirements for deadlock-free, adaptive packet routing. SIAM J. Comput. 23, 6, 1266-1274.
6. DALLY, W. J. 1988. Fine-grain message-passing concurrent computers. In Proceedings of the 3rd Conference on Hypercube Concurrent Computers, volume 1, 2-12.
7. DALLY, W. J. 1992. Virtual-channel flow control. IEEE Trans. Parall Disti. Syst. 3, 2, 194-205.
8. DALLY, W. J., AND SEITZ, C. L. 1987. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. Comput. C-36, 5, 547-553.
9. DONGARRA, J., VAN DE GEUN, R., AND WHALEY, R. 1993. Two dimensional basic linear algebra communication subprograms. In Proceedings of the SIAM Conference on Parallel Processing, 347-352.
10. DRAPER, J. T., AND GHOSH, J. 1992. Multipath E-cube algorithms (MECA) for adaptive wormhole routing and broadcasting in k-ary n-cubes. In Proceedings of the International Parallel Processing Symposium, 407-410.
11. DUATO, J. 1991. On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies. In Proceedings of the Parallel Architectures and Languages Europe 91, volume I, 390-405.
12. DUATO, J. 1993. A new theory of deadlock-free adaptive routing in wormhole networks. IEEE Trans. Parall. Distr. Syst. 4, 12 (Dec.), 1320-1331.
13. DUATO, J. 1995. A theory of deadlock-free adaptive multicast routing in wormhole networks. IEEE Trans. Parall. Disti. Syst. 6, 9 (Sept.), 976-987.
14. DUATO, J., YALAMANCHILI, S., AND NI, L. 2003. Interconnection Networks: An Engineering Approach. Morgan-Kaufmann, San Fransisco, Calif.
15. FLEURY, E., AND FRAIGNIAUD, P. 1997. Deadlock avoidance in wormhole-routed networks. In Proceedings of the 10th International Conference on Parallel and Distributed Computing Systems, 378-384.
16. GLASS, C., AND NI, L. M. 1992a. Adaptive routing in mesh-connected networks. In Proceedings of the 12th International Conference on Distributed Computing Systems, 12-19.
17. GLASS, C., AND NI, L. M. 1992b. Maximally fully adaptive routing in 2D meshes. In Proceedings of the International Conference on Parallel Processing, volume 1, 101-104.
18. GLASS, C., AND NI, L. M. 1992c. The turn model for adaptive routing. In Proceedings of the 19th Annual International Symposium on Computer Architecture, 278-287.
19. JAYASIMHA, D. N., MANIVANNAN, D., MAY, J. A., SCHWIEBERT, L., AND HARY, S. L. 1996. A foundation for designing deadlock-free routing algorithms in wormhole networks. In Proceedings of the Symposium on Parallel and Distributed Processing, 190-197.
20. JESSHOPE, C. R., MILLER, P. R., AND YANTCHEV, J. T. 1989. High performance communications in processor networks. In Proceedings of the 16th Annual International Symposium on Computer Architecture, 150-157.
21. KUMAR, V., GRAMA, A., GUPTA, A., AND KARYPIS, G. 1994. Introduction to Parallel Computing. Benjamin/Cummings Publishing Company, Redwood City, Calif.
22. LIN, X., MCKINLEY, P. K., AND NI. L. M. 1994. Deadlock-free wormhole routing in 2-D mesh multi-computers. IEEE Trans. Parall. Distri. Syst. 5, 8 (Aug), 793-804.
23. LIN, X., MCKINLEY, P. K., AND Ni, L. M. 1995. The message flow model for routing in wormhole-routed networks. IEEE Trans. Parall. Distri. Syst. 6, 7 (July), 755-760.
24. LIN, X., AND NI, L. 1991. Deadlock-free multicast wormhole routing in multicomputer networks. In Proceedings of the 18th Annual International Symposium on Computer Architecture, 116-125.
25. LINDER, D. H., AND HARDEN, J. C. 1991. An adaptive and fault tolerant wormhole routing strategy for k-ary n-cubes. IEEE Trans. Comput. 40, 1 (Jan.), 2-12.
26. MCKINLEY, P. K., TSAI, Y.-J., AND ROBINSON, D. F. 1995. Collective communication in wormhole-routed massively parallel computers. IEEE Comput. 28, 12 (Dec.), 39-50.
27. NI,L. M. 1995. Should scalable parallel computers support efficient hardware multicasting? In Proceedings of the ICPP Workshop on Challenges for Parallel Processing, 2-7.
28. NI, L. M., AND MCKINLEY, P. K. 1993. A survey of wormhole routing techniques in direct networks. IEEE Comput. 26, 2 (Feb.), 62-76.
29. PANDA, D. K., SINGAL, S., AND PRABHAKARAN, P. 1994. Multidestination message passing conforming to base wormhole routing scheme. In Proceedings of the Parallel Computer Routing and Communication Workshop, 131-145.
30. SCHWIEBERT, L. 1997. Deadlock-free oblivious wormhole routing with cyclic dependencies. In Proceedings of the 9th Annual ACM Symposium on Parallel Algorithms and Architectures, 149-158.
31. SCHWIEBERT, L., AND JAYASIMHA, D. N. 1993. Optimal fully adaptive wormhole routing for meshes. In Proceedings of the Supercomputing '93, 782-791.
32. SCHWIEBERT, L., AND JAYASIMHA, D. N. 1995a. A universal proof technique for deadlock-free routing in interconnection networks. In Proceedings of the 7th Annual ACM Symposium on Parallel Algorithms and Architectures ACM, New York, 175-184.
33. SCHWIEBERT, L., AND JAYASIMHA, D. N. 1995b. Optimal fully adaptive minimal wormhole routing for meshes. J. Parall Distri. Comput. 27, 1 (May), 56-70.
34. SCHWIEBERT, L., AND JAYASIMHA, D. N. 1996. A necessary and sufficient condition for deadlock-free wormhole routing. J. Parall. Distri. Comput. 32, 1 (Jan.), 103-117.
35. YANG, C. S., AND TSAI, Y. M. 1992. Fault-tolerant and deadlock-free wormhole routing in the hypercube network. In Proceedings of the International Conference on Parallel and Distributed Systems, 9-16.