Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
An Optimal Shortest-Path Routing Policy for Network Computers with Regular Mesh-Connected Topologies
IEEE Transactions on Computers
On the design of deadlock-free adaptive routing algorithms for multicomputers: design methodologies
PARLE '91 Proceedings on Parallel architectures and languages Europe : volume I: parallel architectures and algorithms: volume I: parallel architectures and algorithms
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes
IEEE Transactions on Computers
Chaos router: architecture and performance
ISCA '91 Proceedings of the 18th annual international symposium on Computer architecture
Planar-adaptive routing: low-cost adaptive networks for multiprocessors
ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
The turn model for adaptive routing
Journal of the ACM (JACM)
Improving the efficiency of virtual channels with time-dependent selection functions
Conference proceedings on PARLE'92
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
CSIM: a C-based process-oriented simulation language
WSC '86 Proceedings of the 18th conference on Winter simulation
IEEE Transactions on Parallel and Distributed Systems
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels
IEEE Transactions on Parallel and Distributed Systems
Software-Based Deadlock Recovery Technique for True Fully Adaptive Routing in Wormhole Networks
ICPP '97 Proceedings of the international Conference on Parallel Processing
NOCS '08 Proceedings of the Second ACM/IEEE International Symposium on Networks-on-Chip
An Advanced NoP Selection Strategy for Odd-Even Routing Algorithm in Network-on-Chip
ICA3PP '09 Proceedings of the 9th International Conference on Algorithms and Architectures for Parallel Processing
Quarter Load Threshold (QLT) flow control for wormhole switching in mesh-based Network-on-Chip
Journal of Systems Architecture: the EUROMICRO Journal
A deadlock-free routing algorithm for dynamically reconfigurable Networks-on-Chip
Microprocessors & Microsystems
DBAR: an efficient routing algorithm to support multiple concurrent applications in networks-on-chip
Proceedings of the 38th annual international symposium on Computer architecture
High and stable performance under adverse traffic patterns of tori-connected torus network
Computers and Electrical Engineering
| Hi-index | 0.00 |
Many adaptive routing algorithms have been proposed for wormhole-routed interconnection networks. Comparatively little work, however, has been done on determining how the selection function (routing policy) affects the performance of an adaptive routing algorithm. In this paper, we present a detailed simulation study of various selection functions for fully adaptive wormhole routing on two-dimensional meshes. The simulation results show that the choice of selection function has a significant effect on the average message latency. In addition, it is possible to find a single selection function that exhibits excellent performance across a wide range of traffic patterns, network sizes, and number of virtual channels. Thus, a well-chosen selection function for an adaptive routing algorithm can lead to consistently better performance than an arbitrary selection function. One of the selection functions considered is a theoretically optimal selection function (IEEE Trans. Comput. 38(10) (October 1989), 1362-1371). We show that although theoretically optimal, the actual performance of the optimal selection function is not always best. An explanation and interpretation of the results is provided.