Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels

IEEE Transactions on Parallel and Distributed Systems

Volumn 4, Issue 4, 1993, Pages 466-475

  Dally, William J ^a   Aoki, Hiromichi ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Communication networks; concurrent computing; flow control; interconnection networks; multicomputers; packet routing; parallel processing

Indexed keywords

ALGORITHMS; COMMUNICATION NETWORKS; COMMUNICATION SYSTEMS; PARALLEL PROCESSING SYSTEMS;

DEADLOCK FREE ADAPTIVE ROUTING; PARALLEL PROCESSING; VIRTUAL CHANNEL UTILIZATION;

COMPUTER NETWORKS;

EID: 0027579765     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.219761     Document Type: Article

References (45)

1. J. K. Annot and R. A. H. van Twist, “A novel deadlock free and starvation free packet switching communication processor,” in Parallel Architectures and Languages Europe 1987, 1987, pp. 68–85.
2. W. C. Athas and C. L. Seitz, “Multicomputers: Message-passing concurrent computers,” IEEE Compuf. Mag., vol. 21, no. 8, pp. 9-24, Aug. 1988.
3. H. G. Badr and S. Podar, “An optimal shortest-path routing policy for network computers with regular mesh-connected topologies,” IEEE Trans. Comput., vol. 38, no. 10, pp. 1362–1371, Oct. 1989.
4. P. R. Bell and K. Jabbour, “Review of point-to-point network routing alorithms,” IEEE Commun. Mag., vol. 24, no. 1, pp. 34–38, Jan. 1986.
5. D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1987.
6. S. Borkar et al., “iWARP: An integrated solution to high-speed parallel computing,” in Proc. Supercomput. Conf, IEEE, Nov. 1988, pp. 330–338.
7. M.-S. Chen and K. G. Shin, “Adaptive fault-tolerant routing in hypercube multicomputers,” IEEE Trans. Comput., vol. 39, no. 12, pp. 1406–1416, Dec. 1990.
8. M.-S. Chen and K. G. Shin, “Depth-first search approach for fault-tolerant routing in hypercube multicomputers,” IEEE Trans. Parallel Distributed Syst., vol. 1, no. 2, pp. 152–159, Apr. 1990.
9. A. Andai Chien, “Congestion control in routing networks,” Master’s thesis, Massachusetts Instit. Technol., Cambridge, MA, Oct. 1986.
10. E. Chow, H. Madan, and J. Peterson, “A real-time adaptive message routing network for the hypercube computer,” in Proc. 8th Real Time Syst. Symp., IEEE, 1987, pp. 88–96.
11. Ametek Corp., Ametek 2010 Product Announcement, 1987.
12. W. J. Dally, “Fine-grain message passing concurrent computers,” in Proc. Third Conf. Hypercube Concurrent Comput., vol. 1, Pasadena, CA, Jan. 1988, pp. 2–12. VLSI memo 88–454.
13. W. J. Dally, “Network and processor architecture for message-driven computers,” in VLSI and Parallel Computation, Suaya and Birtwhistle, Eds. Palo, Alto, CA: Morgan Kaufmann, 1990.
14. W. J. Dally, “Performance analysis of k-ary n-cube interconnection net works,” IEEE Trans. Comput., vol. 39, no. 6, June 1990. Also appears as a chapter in Artificial Intelligence at MIT, Expanding Frontiers, edited by P. H. Winston, with S. A. Shellard, MIT Press, 1990, vol. 1, pp. 548–581.
15. W. J. Dally, “Virtual-channel flow control,” in Proc. 17th Annu. Int. Symp. Comput. Architecture, May 1990, pp. 60–68.
16. W. J. Dally et al, “The J-Machine: A fine-grain concurrent computer,” in Proc. IFIP Congress, G. X. Ritter, Ed., North-Holland, Aug. 1989, 1147–1153.
17. W. J. Dally and C. L. Seitz, “The torus routing chip,” Distributed Comput., vol. 1, pp. 187–196, 1986.
18. W. J. Dally and C. L. Seitz, “Deadlock free message routing in multiprocessor interconnection networks,” IEEE Trans. Comput., vol. C-36, no. 5, pp. 547–553, May 1987.
19. W. J. Dally and P. Song, “Design of a self-timed VLSI multicomputer communication controller,” in Proc. Int. Conf. Comput. Design, IEEE, Computer Society Press, Oct. 1987, pp. 230–234.
20. J. Duato, “On the design of deadlock-free adaptive routing algorithms for multicomputers: Design methodologies,” in Parallel Architectures and Languages Europe, 1991.
21. J. Duato, “On the design of deadlock-free adaptive routing algorithms for multicomputers: Theoretical aspects,” in Proc. 2nd European Distributed Memory Comput. Conf, 1991.
22. C. M. Flaig, “VLSI mesh routing systems,” Master’s thesis, California Instit. Technol., 1987.
23. R. M. Fujimoto, “VLSI communication components for multicomputer networks,” Tech. Rep. UCB/CSD/83/137, Comput. Sci. Div., Univ. California at Berkeley, Berkeley, CA 94720, Sept. 1983.
24. R. G. Gallager, “A minimum delay routing algorithm using distributed computation,” IEEE Trans. Commun., vol. COM-25, no. 1, pp. 73–85, Jan. 1977.
25. D. Gelernter, “A DAG-based algorithm for prevention of store-and-forward deadlock in packet networks,” IEEE Trans. Comput., vol. C-30, no. 10, pp. 709–715, Oct. 1981.
26. D. C. Grunwald, “Circuit switched multicomputer and heuristic load placement,” Tech. Rep. UIUCDCS-R-89-1514, Dep. Comput. Sci., Univ. Illinois, Dep. Comput. Sci., Univ. Illinois at Urbana-Champaign Urbana, IL 61801–2987, Sept. 1989.
27. 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.
28. BBN Advanced Computers Inc., “Butterfly parallel processor overview,” BBN Rep. 6148, Mar. 1986.
29. P. Kermani and L. Kleinrock, “Virtual cut through: A new computer communication switching technique,” Comput. Networks, vol. 3, pp. 267–286, 1979.
30. C.-K. Kim and D. A. Reed, “Adaptive packet routing in a hypercube,” in Proc. Third Conf. Hypercube Concurrent Comput. Appl., ACM Press, Jan. 1988, pp. 625 - 630.
31. S. Konstantinidou, “Adaptive minimal routing in hypercubes,” in Proc. 6th MIT Conf. Advanced Res. VLSI, 1990, pp. 139–153.
32. S. Konstantinidou and L. Snyder, “Chaos router: A practical application of randomization in network routing,” in Proc. Symp. Parallel Architectures Algorithms, 1990, 21–30.
33. S. Konstantinidou and L. Snyder, “Chaos router: Architecture and performance,” in Proc. 18th Annu. Symp. Comput. Architecture, 1991, pp. 212–221.
34. J. N. Mailhot, “Routing and flow control strategies in multiprocessor networks,” S.B. thesis, May 1988.
35. P. M. Merlin and P. J. Schweitzer, “Deadlock avoidance-store-and-forward deadlock,” IEEE Trans. Commun., vol. COM-28, no. 3, pp. 345–354, Mar. 1980.
36. W. G. P. Mooij and A. Ligtenberg, “Architecture of a communication network processor,” in Proc. parallel Architectures and Languages Europe 1989, Springer-Verlag, 1989, pp. 238–250.
37. D. Nassimi and S. Sahni, “An optimal routing algorithm for mesh-connected parallel computers,” J. ACM, vol. 27, no. 1, pp. 6–29, Jan. 1980.
38. D. Nassimi and S. Sahni, “Optimal BPC permutations on a cube connected SIMD computer,” IEEE Trans. Comput., vol. C-31, no. 4, pp. 338–341, Apr. 1982.
39. J. Y. Ngai, “A framework for adaptive routing in multicomputer networks,” Ph.D. dissertation, Caltech, 1989.
40. J. Y. Ngai and C. L. Seitz, “A framework for adaptive routing in multicomputer networks,” in Proc. ACM Symp. Parallel Algorithms and Architectures, 1989.
41. D. A. Reed and R. M. Fujimoto, Multicomputer Networks: Message-Based Parallel Processing. Cambridge, MA: MIT Press, 1987.
42. C. L. Seitz, “The Cosmic cube,” Commun. ACM, vol. 28, no. 1, pp. 22–33, Jan. 1985.
43. A. S. Tanenbaum, Computer Networks, second ed. Englewood Cliffs, NJ: Prentice-Hall, 1988.
44. L. G. Valiant, “A scheme for fast parallel communication,” SIAM J. Comput., vol. 11, no. 2, pp. 350–361, May 1982.
45. L. G. Valiant, “Optimality of a two-phase strategy for routing in interconnection networks,” IEEE Trans. Comput., vol. C-32, no. 9, pp. 861–863, Sept. 1983.