A framework for adaptive routing in multicomputer networks
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
The efficiency of greedy routing in hypercubes and butterflies
SPAA '91 Proceedings of the third annual ACM symposium on Parallel algorithms and architectures
Fully-adaptive routing: packet switching performance and wormhole algorithms
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
The turn model for adaptive routing
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A comparison of adaptive wormhole routing algorithms
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
Adaptive Deadlock- and Livelock-Free Routing in the Hypercube Network
IEEE Transactions on Parallel and Distributed Systems
Bounds on the greedy routing algorithm for array networks
Journal of Computer and System Sciences
IEEE Transactions on Parallel and Distributed Systems
Performance Evaluation of Adaptive Routing Algorithms for k-ary-n-cubes
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Design of a Router for Fault-Tolerant Networks
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Performance Analysis of a Minimal Adaptive Router
PCRCW '94 Proceedings of the First International Workshop on Parallel Computer Routing and Communication
Online adaptive fault-tolerant routing in 2d torus
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
The performance analysis of dynamic routing algorithms in interconnection networks of parallel computers has thus far predominantly been done by simulation studies. A limitation of simulation studies is that they usually only hold for specific combinations of network, routing algorithm, and traffic pattern. In this paper, we derive saturation point results for the class of homogeneous traffic patterns and a large class of routing functions on meshes. We show that the best possible saturation point on a mesh is half the best possible saturation point on a torus. We also show that, if we restrict ourselves to homogeneous routing functions, the worst possible saturation point on a mesh is again half the best possible saturation point. Finally, we present a class of homogeneous routing functions, containing the well-known e-cube routing function, which are all optimal for all homogeneous traffic patterns.