A Critique of Adaptive Routing

Authors:
Michael J. Pertel
Affiliations:
-
Venue:
A Critique of Adaptive Routing
Year:
1992

Citing 0
Cited 6

ROMM routing on mesh and torus networks

Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Petri net modeling of interconnection networks for massively parallel architectures

ICS '95 Proceedings of the 9th international conference on Supercomputing
Universal Wormhole Routing

IEEE Transactions on Parallel and Distributed Systems
The Case for Chaotic Adaptive Routing

IEEE Transactions on Computers
Modeling of interconnection subsystems for massively parallel computers

Performance Evaluation
Deadlock-free connection-based adaptive routing with dynamic virtual circuits

Journal of Parallel and Distributed Computing

Quantified Score

Hi-index	0.00

Visualization

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.