Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published January 1, 1986 | public
Report Open

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

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.

Files

postscript.pdf
Files (1.8 MB)
Name Size Download all
md5:6f587b0a82abdf5fb4a2f6b050dfe564
980.7 kB Download
md5:a9843ee4df7a9367d98ae5105fe938a0
851.7 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
December 22, 2023