Published January 1, 1986
| public
Technical Report
Open
On the Performance of k-ary n-cube Interconnection Networks
- Creators
- Dally, William J.
Chicago
An error occurred while generating the citation.
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
- Eprint ID
- 26664
- Resolver ID
- CaltechCSTR:1986.5228-tr-86
- Created
-
2001-04-20Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports