Document Type

Article

Publication Date

9-1996

Publication Title

Proceedings of the ISCA 9th International Conference on Parallel and Distributed Computing Systems

Pages

260--267

Abstract

This paper provides empirical comparison of the communication capabilities of two area-universal networks, the fat-tree and the fat-pyramid, to the popular mesh and hypercube networks for parallel computation. While area-universal networks have been proven capable of simulating, with modest slowdown, any computation of any other network of comparable area, prior work has generally left open the question of how area-universal networks compare to other networks in practice. Comparisons are performed using techniques of throughput and latency analysis that have previously been applied to k-ary n-cube networks and using various existing models to equate the hardware cost of the networks being compared. The increasingly popular wormhole routing model is used throughout.

Comments

This paper focuses on wormhole routing. Readers may also be interested in a related paper http://ecommons.luc.edu/cs_facpubs/154 that considers both wormhole and packet routing.

Creative Commons License

Creative Commons License
This work is licensed under a Creative Commons Attribution-Noncommercial-No Derivative Works 3.0 License.

GreenbergG1996ECA_slides.pdf (235 kB)
Slides from presentation by Lee Guan at ISCA 9th International Conference on Parallel and Distributed Computing Systems

Share

COinS