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

Authors:
Hamid Sarbazi-Azad;Lewis M. Mackenzie;Mohamed Ould-Khaoua
Affiliations:
-;-;-
Venue:
ISHPC '00 Proceedings of the Third International Symposium on High Performance Computing
Year:
2000

Citing 19
Cited 0

Performance Analysis of k-ary n-cube Interconnection Networks

IEEE Transactions on Computers
The turn model for adaptive routing

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
A comprehensive analytical model for wormhole routing in multicomputer systems

Journal of Parallel and Distributed Computing
A Cost and Speed Model for k-ary n-Cube Wormhole Routers

IEEE Transactions on Parallel and Distributed Systems
Packet routing in fixed-connection networks: a survey

Journal of Parallel and Distributed Computing
A Performance Model for Duato's Fully Adaptive Routing Algorithm in k$k$-Ary n$n$-Cubes

IEEE Transactions on Computers
Performance of the CRAY T3E multiprocessor

SC '97 Proceedings of the 1997 ACM/IEEE conference on Supercomputing
Advanced Computer Architecture: Parallelism,Scalability,Programmability

Advanced Computer Architecture: Parallelism,Scalability,Programmability
Interconnection Networks: An Engineering Approach

Interconnection Networks: An Engineering Approach
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
Limits on Interconnection Network Performance

IEEE Transactions on Parallel and Distributed Systems
Virtual-Channel Flow Control

IEEE Transactions on Parallel and Distributed Systems
An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing

IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
An Analytical Model of Fully-Adaptive Wormhole-Routed k-Ary n-Cubes in the Presence of Hot Spot Traffic

IPDPS '00 Proceedings of the 14th International Symposium on Parallel and Distributed Processing
Performance Analysis of k-Ary n-Cubes with Fully Adaptive Routing

ICPADS '00 Proceedings of the Seventh International Conference on Parallel and Distributed Systems
Theory, Volume 1, Queueing Systems

Theory, Volume 1, Queueing Systems
Adaptive Deadlock-Free Routing in Multicomputers Using Only One Extra Virtual Channel

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01
The Message Flow Model for Routing in Wormhole-Routed Networks

ICPP '93 Proceedings of the 1993 International Conference on Parallel Processing - Volume 01

Quantified Score

Hi-index	0.00

Visualization

Abstract

Several analytical models of fully adaptive routing in wormholerouted k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. This paper describes the first analytical model of fully adaptive routing in k-ary n-cubes in the presence of non-uniform traffic generated by the digit-reversal permutation, which is an important communication operation found in many matrix computation problems. Results obtained through simulation experiments confirm that the model predicts message latency with a good degree of accuracy under different working conditions.