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

Dally, William J. (1986) On the Performance of k-ary n-cube Interconnection Networks. Technical Report. California Institute of Technology. [CaltechCSTR:1986.5228-tr-86]

Full text available as:

	Postscript - Requires a viewer, such as GhostView
	Other (Adobe PDF)

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.

EPrint Type:	Monograph (Technical Report)
Subjects:	All Records
ID Code:	8
Deposited By:	Caltech Library System
Deposited On:	20 April 2001
Record Number:	CaltechCSTR:1986.5228-tr-86
Official Persistent URL:	http://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.

Archive Staff Only: edit this record