A Caltech Library Service

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

Dally, William J. (1986) On the Performance of k-ary n-cube Interconnection Networks. California Institute of Technology . (Unpublished)

See Usage Policy.

Other (Adobe PDF)
See Usage Policy.


Use this Persistent URL to link to this item:


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.

Item Type:Report or Paper (Technical Report)
Group:Computer Science Technical Reports
Record Number:CaltechCSTR:1986.5228-tr-86
Persistent URL:
Usage Policy:You are granted permission for individual, educational, research and non-commercial reproduction, distribution, display and performance of this work in any format.
ID Code:26664
Deposited By: Imported from CaltechCSTR
Deposited On:20 Apr 2001
Last Modified:03 Oct 2019 03:16

Repository Staff Only: item control page