Performance Analysis of k-Ary n-Cube Interconnection Networks
Performance Analysis of k-Ary n-Cube Interconnection Networks
复制标题
DOI：
10.1109/12.53599
复制
发表时间：
1987-11
期刊：
影响因子：
--
通讯作者：
W. Dally
中科院分区：
文献类型：
--
作者：
W. Dally
超大规模集成电路通信网络受限于布线，即网络的成本不是所需交换机数量的函数，而是构建网络所需布线密度的函数。在恒定的线平分假设下，对不同维度的通信网络进行了分析。推导出了与实验测量结果非常吻合的具有恒定平分的k元n立方体网络的延迟、平均情况下的吞吐量以及热点吞吐量的表达式。结果表明，在具有相同平分宽度的情况下，低维网络（例如环面）比高维网络（例如二进制n立方体）具有更低的延迟和更高的热点吞吐量。
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. >