This Article 
 Bibliographic References 
 Add to: 
Performance Analysis of k-ary n-cube Interconnection Networks
June 1990 (vol. 39 no. 6)
pp. 775-785

VLSI communication networks are wire-limited, i.e. the cost of a network is not a function of the number of switches required, but rather a function of the wiring density required to construct the network. Communication networks of varying dimensions are analyzed under the assumption of constant wire bisection. Expressions for the latency, average case throughput, and hot-spot throughput of k-ary n-cube networks with constant bisection that agree closely with experimental measurements are derived. It is shown that low-dimensional networks (e.g. tori) have lower latency and higher hot-spot throughput than high-dimensional networks (e.g. binary n-cubes) with the same bisection width.

[1] Ametek Corporation, Ametek 2010 product announcement, 1987.
[2] K. E. Batcher, "Sorting networks and their applications," inProc. AFIPS FJCC, vol. 32, 1968, pp. 307-314.
[3] K. E. Batcher, "The Flip network in STARAN," inProc. 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. Boston, MA: Kluwer Academic, 1987, pp. 144-161.
[8] W.J. Dally and C.L. Seitz, "Deadlock-Free Message Routing in Multiprocessor Interconnection Networks,"IEEE Trans. Computers, Vol. C-36, No. 5, May 1987, pp. 547-553.
[9] W. J. Dally and C. L. Seitz, "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," inProc. Stanford Conf. Advanced Res. VLSI, Losleben, Ed. Cambridge, MA: MIT Press, Mar. 1987, pp. 391-415.
[11] W. J. Dally, L. Chao, and A. Chien et al., "Architecture of a message-driven processor," inProc. 14th Annu. Symp. Comput. Architecture, ACM, June 1987, pp. 189-196.
[12] W. J. Dally and P. Song, "Design of a self-timed VLSI multicomputer communicationcontroller," inProc. 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. E. Leiserson, "Fat-trees: Universal networks for hardware-efficient supercomputing,"IEEE Trans. Comput., vol. C-34, pp. 892-900, Oct. 1985.
[16] C. Mead and L. Conway,Introduction to VLSI Systems. Reading, MA: Addison-Wesley, 1980, pp. 150-152.
[17] M. C. Pease, III, "The indirect binaryn-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. Comput., vol. C-33, no. 12, pp. 1247-1265, Dec. 1984.
[20] C. L. Seitzet 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," inProc. 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. Sulivan and T. R. Bashkov, "A large scale homogeneous, fully distributed parallel machine, I," inProc. 4th Symp. Comput. Arch., March 1977, pp. 105-117.
[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.

Index Terms:
k-ary n-cube interconnection networks; VLSI communication networks; switches; average case throughput; low-dimensional networks; multiprocessor interconnection networks; VLSI.
W.J. Dally, "Performance Analysis of k-ary n-cube Interconnection Networks," IEEE Transactions on Computers, vol. 39, no. 6, pp. 775-785, June 1990, doi:10.1109/12.53599
Usage of this product signifies your acceptance of the Terms of Use.