Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers

Volumn 39, Issue 6, 1990, Pages 775-785

  Dally, William J ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Communication networks; concurrent computing; interconnection networks; message passing multiprocessors; parallel processing; VLSI

Indexed keywords

COMPUTERS, DIGITAL--DATA COMMUNICATION SYSTEMS; INTEGRATED CIRCUITS, VLSI--PERFORMANCE;

INTERCONNECTION NETWORKS; MESSAGE-PASSING MULTIPROCESSORS; VLSI COMMUNICATION NETWORKS;

COMPUTER SYSTEMS, DIGITAL;

EID: 0025448089     PISSN: 00189340     EISSN: None     Source Type: Journal    
DOI: 10.1109/12.53599     Document Type: Article

References (26)

1. Ametek Corporation, Ametek 2010 product announcement, 1987.
2. K. E. Batcher, “Sorting networks and their applications,” in Proc. AFIPS FJCC, vol. 32, 1968, pp. 307–314.
3. K. E. Batcher, “The Flip network in STARAN,” in Proc. 1976 Int. Conf. Parallel Processing, pp. 65–71.
4. V. E. Benes, Mathematical Theory of Connecting Networks and Telephone Traffic. New York: Academic, 1965.
5. L. N. Bhuyan and D. P. Agrawal, “Generalized hypercube and hyper-bus structures for a computer network,” IEEE Trans. Comput., vol. C-33, no. 4, pp. 323–333, Apr. 1984.
6. S. Browning, “The tree machine: A highly concurrent computing environment,” Dep. Comput. Sci., California Instit. Technol., Rep. 3760, 1980.
7. W. J. Dally, A VLSI Architecture for Concurrent Data Structures. Hingham, MA: Kluwer, 1987.
8. 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.
9. —, “The torus routing chip,” J. Distributed Syst., vol. 1, no. 3, pp. 187–196, 1986.
10. W. J. Dally, “Wire efficient VLSI multiprocessor communication networks,” in Proc. Stanford Conf. Advanced Res. VLSI, Losleben, Ed. Cambridge, MA: MIT Press, Mar. 1987, pp. 391–415.
11. W. J. Dally et al., “Architecture of a message-driven processor,” in Proc. 14th ACM/IEEE Symp. Comput. Architecture, June 1987, pp. 189–196.
12. W. J. Dally and P. Song, “Design of a self-timed VLSI multicomputer communication controller,” in Proc. IEEE Int. Conf. Comput. Design, 1987.
13. P. Kermani and L. Kleinrock, “Virtual cut-through: A new computer communication switching technique,” Comput. Networks, vol. 3, pp. 267–286, 1979.
14. D. H. Lawrie, “Alignment and access of data in an array processor,” IEEE Trans. Comput., vol. C-24, no. 12, pp. 1145–1155, Dec. 1975.
15. C. L. Leiserson, “Fat trees: Universal networks for hardware-efficient supercomputing,” IEEE Trans. Comput., vol. C-34, no. 10, pp. 892–901, Oct. 1985.
16. C. A. Mead and L. A. Conway, Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980.
17. M. C. Pease, III, “The indirect binary n-cube microprocessor array,” IEEE Trans. Comput., vol. C-26, no. 5, pp. 458–473, May 1977.
18. G. F. Pfister and V. A. Norton, “Hot spot contention and combining in multistage interconnection networks,” IEEE Trans. Comput., vol. C-34, no. 10, pp. 943–948, Oct. 1985.
19. C. L. Seitz, “Concurrent VLSI architectures,” IEEE Trans. Corn-put., vol. C-33, no. 12, pp. 1247–1265, Dec. 1984.
20. C. L. Seitz et al., “The hypercube communications chip,” Dep. Comput. Sci., California Inst. Technol., Display File 5182:DF:85, Mar. 1985.
21. C. H. Sequin, “Single chip computers, The new VLSI building block,” in Proc. Caltech Conf. VLSI, C. L. Seitz, Ed., Jan. 1979, pp. 435–452.
22. H. J. Siegel, “Interconnection network for SIMD machines,” IEEE Comput. Mag., vol. 12, no. 6, pp. 57–65, June 1979.
23. H. S. Stone, “Parallel processing with the perfect shuffle,” IEEE Trans. Comput., vol. C-20, no. 2, pp. 153–161, Feb. 1971.
24. H. Sullivan and T. R. Bashkow, “A large scale homogeneous machine,” in Proc. 4th Ann. Symp. Comput. Architecture, 1977, pp. 105–124.
25. A. S. Tanenbaum, Computer Networks. Englewood Cliffs, NJ: Prentice-Hall, 1981.
26. C. D. Thompson, “A complexity theory of VLSI,” Dep. Comput. Sci., Carnegie-Mellon Univ., Tech. Rep. CMU-CS-80-140, Aug. 1980.