PERFORMANCE ANALYSIS OF K-ARY N-CUBE INTERCONNECTION NETWORKS

被引：499

作者：

DALLY, WJ ^{[1
]}

机构：

[1] MIT,COMP SCI LAB,CAMBRIDGE,MA 02139

来源：

IEEE TRANSACTIONS ON COMPUTERS | 1990年 / 39卷 / 06期

基金：

美国国家科学基金会;

关键词：

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

D O I：

10.1109/12.53599

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

VLSI communication networks are wire-limited. 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. This paper analyzes communication networks of varying dimension 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 are derived that agree closely with experimental measurements. 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. © 1990 IEEE

引用

页码：775 / 785

页数：11