Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
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
Performance Analysis of Mesh Interconnection Networks with Deterministic Routing
IEEE Transactions on Parallel and Distributed Systems
An Analytical Model of Duato's Fully-Adaptive Routing Algorithm in k-Ary n-Cubes
ICPP '98 Proceedings of the 1998 International Conference on Parallel Processing
An Accurate Model for the Performance Analysis of Deterministic Wormhole Routing
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
A survey and comparison of wormhole routing techniques in a mesh networks
IEEE Network: The Magazine of Global Internetworking
Outstanding research problems in NoC design: system, microarchitecture, and circuit perspectives
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Analytic performance modeling of a fully adaptive routing algorithm in the torus
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
| Hi-index | 0.00 |
This paper presents an analytical evaluation of the performance of wormhole switching with adaptive routing in a two-dimensional torus. Our analysis focuses on minimal and fully adaptive routing that allows a message to use any shortest path between source and destination.