Pertel, Michael J. (1992) A Critique of Adaptive Routing. California Institute of Technology . (Unpublished) http://resolver.caltech.edu/CaltechCSTR:1992.cs-tr-92-06
![[img]](http://authors.library.caltech.edu/style/images/fileicons/application_postscript.png)
|
Postscript
See Usage Policy. 475Kb | |
![[img]](http://authors.library.caltech.edu/style/images/fileicons/other.png)
|
Other (Adobe PDF (466KB))
See Usage Policy. 454Kb |
Use this Persistent URL to link to this item: http://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) |
|---|---|
| Group: | Computer Science Technical Reports |
| Record Number: | CaltechCSTR:1992.cs-tr-92-06 |
| Persistent URL: | http://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: | 26 Dec 2012 14:04 |
Repository Staff Only: item control page
