Performance Tuning of Adaptive Wormhole Routing through Selection Function Choice
✍ Scribed by Loren Schwiebert; Renelius Bell
- Publisher
- Elsevier Science
- Year
- 2002
- Tongue
- English
- Weight
- 300 KB
- Volume
- 62
- Category
- Article
- ISSN
- 0743-7315
No coin nor oath required. For personal study only.
✦ Synopsis
Many adaptive routing algorithms have been proposed for wormholerouted 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(October ), 1362(October -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.