Performance Analysis of k-ary n-cube Interconnection Networks
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A comparison of adaptive wormhole routing algorithms
ISCA '93 Proceedings of the 20th annual international symposium on computer architecture
The turn model for adaptive routing
Journal of the ACM (JACM)
Optimal fully adaptive minimal wormhole routing for meshes
Journal of Parallel and Distributed Computing
A Traffic-Balanced Adaptive Wormhole Routing Scheme for Two-Dimensional Meshes
IEEE Transactions on Computers
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Mesh Interconnection Networks with Deterministic Routing
IEEE Transactions on Parallel and Distributed Systems
Balancing Buffer Utilization in Meshes Using a 'Restricted Area' Concept
IEEE Transactions on Parallel and Distributed Systems
Performance Analysis of Minimal Adaptive Wormhole Routing with Time-Dependent Deadlock Recovery
IPPS '97 Proceedings of the 11th International Symposium on Parallel Processing
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
Hi-index | 0.00 |
This paper uses the idea of dynamic channel selection to balance traffic in a mesh network. The key point is to maintain the history of channel utilisation in each node. Based on the recorded information, the node router can predict the current load distribution and route packets through less trafficked channels to avoid congestion. To fit different routing characteristics, three dynamic channel selection policies, DCS-I, DCS-II and DCS-III, are presented. Experimental results show that when network traffic gets heavy, DCS-II and DCS-III yield constantly better throughput, lower communication latency and more even buffer utilisation pinpointing the important link between balanced network traffic and desirable performance.