An Analytical Model of Fully-Adaptive Wormhole-Routed k-Ary n-Cubes in the Presence of Hot Spot Traffic

Authors:
Affiliations:
Venue:
IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Year:
2000

Citing 0
Cited 4

An Analytic Model for Communication Latency in Wormhole-Switched k-ary n-Cube Interconnection Networks with Digit-Reversal Traffic

ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
An Analytical Model of Deterministic Routing in the Presence of Hot-Spot Traffic

Euro-Par '01 Proceedings of the 7th International Euro-Par Conference Manchester on Parallel Processing
A Performance Model of Adaptive Routing in k-Ary n-Cubes with Matrix-Transpose Traffic

ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
Analytically Modeling a Fault-Tolerant Messaging Protocol

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several analytical models of fully adaptive routing have recently been proposed for wormhole-routed k-ary n-cubes under the uniform traffic pattern. However, there has been hardly any model reported yet that deals with other important non-uniform traffic patterns, such as hot spots. As a result, most studies have resorted to simulation when evaluating the performance merits of adaptive routing. This paper describes the first analytical model of fully adaptive wormhole routing in k-ary n-cubes in the presence of hot spot traffic. Results from simulation show close agreement with those predicted by the model.