Several analytical models of fully adaptive routing in wormhole-routed k-ary n-cubes under the uniform traffic pattern have recently been proposed in the literature. Although the uniform reference model has been widely used in the past, it is not always true in practice as there are many application
Performance evaluation of deterministic wormhole routing in k-ary n-cubes
β Scribed by B. Ciciani; M. Colajanni; C. Paolucci
- Publisher
- Elsevier Science
- Year
- 1998
- Tongue
- English
- Weight
- 395 KB
- Volume
- 24
- Category
- Article
- ISSN
- 0167-8191
No coin nor oath required. For personal study only.
β¦ Synopsis
We present a new analytical approach for the performance evaluation of deterministic wormhole routing in k-ary n-cubes. Our methodology achieves closed formulas for average time values through the analysis of network Β―ows. The comparison with simulation models demonstrates that our methodology gives accurate results for both low and high trac conditions. Another important quality is the Β―exibility of our approach. We demonstrate that it can be used to model dimension-ordered-routing in several k-ary n-cubes such as hypercubes, 3D symmetric and asymmetric tori, architectures with uni-and bi-directional channels.
π SIMILAR VOLUMES
Although several analytical models have been proposed in the literature for different interconnection networks with different routing algorithms, there is only one work [M. Ould-Khaoua, An approximate performance model for partially adaptive routing algorithm in hypercubes, Microprocessors and Micro