Issue No. 06 - June (1990 vol. 39)

ISSN: 0018-9340

pp: 775-785

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.53599

ABSTRACT

<p>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.</p>

INDEX TERMS

k-ary n-cube interconnection networks; VLSI communication networks; switches; average case throughput; low-dimensional networks; multiprocessor interconnection networks; VLSI.

CITATION

W. Dally, "Performance Analysis of k-ary n-cube Interconnection Networks," in

*IEEE Transactions on Computers*, vol. 39, no. , pp. 775-785, 1990.

doi:10.1109/12.53599

CITATIONS

SEARCH