Pertel, Michael J. (1992) A Critique of Adaptive Routing. Computer Science Technical Reports, California Institute of Technology , Pasadena, CA. (Unpublished) https://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-06
![]()
|
Postscript
- Submitted Version
See Usage Policy. 487kB | |
![]()
|
PDF
- Submitted Version
See Usage Policy. 465kB |
Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-06
Abstract
This report refutes claims that adaptive routing performs better than dimension-order routing. Simulation results are presented that show dimension-order routing achieves both higher throughput and lower latency than adaptive routing. Specious claims for the advantages of adaptive routing are critiqued.
Item Type: | Report or Paper (Technical Report) | ||||||
---|---|---|---|---|---|---|---|
Additional Information: | © 1992 California Institute of Technology. June 18, 1992. The research described in this report was sponsored by the Defense Advanced Research Projects Agency. Support was provided by a National Defense Science and Engineering Graduate Fellowship. I gratefully acknowledge the direction and assistance of my advisor, Dr. C.L. Seitz. | ||||||
Group: | Computer Science Technical Reports | ||||||
Funders: |
| ||||||
Series Name: | Computer Science Technical Reports | ||||||
DOI: | 10.7907/Z9R78CCZ | ||||||
Record Number: | CaltechCSTR:1992.cs-tr-92-06 | ||||||
Persistent URL: | https://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-06 | ||||||
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: | 26753 | ||||||
Collection: | CaltechCSTR | ||||||
Deposited By: | Imported from CaltechCSTR | ||||||
Deposited On: | 25 Apr 2001 | ||||||
Last Modified: | 03 Oct 2019 03:17 |
Repository Staff Only: item control page