On the Performance of k-ary n-cube Interconnection Networks

Authors:
William J. Dally
Affiliations:
-
Venue:
On the Performance of k-ary n-cube Interconnection Networks
Year:
1986

Citing 0
Cited 2

High performance hypercube communications

C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Optimal Distance Networks of Low Degree for Parallel Computers

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

The performance of k-ary n-cube interconnection networks is analyzed under the assumption of constant wire bisection. It is shown that low-dimensional k-ary n-cube 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.