Dally, William J. (1986) On the Performance of k-ary n-cube Interconnection Networks. California Institute of Technology . (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1986.5228-tr-86
![[img]](https://authors.library.caltech.edu/style/images/fileicons/application_postscript.png)
|
Postscript
See Usage Policy. 980kB | |
![[img]](https://authors.library.caltech.edu/style/images/fileicons/other.png)
|
Other (Adobe PDF)
See Usage Policy. 851kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1986.5228-tr-86
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.
| Item Type: | Report or Paper (Technical Report) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:1986.5228-tr-86 |
| Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1986.5228-tr-86 |
| 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 |
| Collection: | CaltechCSTR |
| Deposited By: | Imported from CaltechCSTR |
| Deposited On: | 20 Apr 2001 |
| Last Modified: | 03 Oct 2019 03:16 |
Repository Staff Only: item control page
