Published April 25, 2001
| Submitted
Report
Open
A Critique of Adaptive Routing
- Creators
- Pertel, Michael J.
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.
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.Attached Files
Submitted - postscript.pdf
Submitted - postscript.ps
Files
postscript.pdf
Files
(953.0 kB)
| Name | Size | Download all |
|---|---|---|
|
md5:9525ff616754599674f573a0132ea968
|
487.3 kB | Download |
|
md5:ba41d2cea5f30406bb9efaa25162525d
|
465.7 kB | Preview Download |
Additional details
- Eprint ID
- 26753
- Resolver ID
- CaltechCSTR:1992.cs-tr-92-06
- Defense Advanced Research Projects Agency (DARPA)
- National Defense Science and Engineering Graduate (NDSEG) Fellowship
- Created
-
2001-04-25Created from EPrint's datestamp field
- Updated
-
2019-10-03Created from EPrint's last_modified field
- Caltech groups
- Computer Science Technical Reports
- Series Name
- Computer Science Technical Reports