Loading...
Please wait, while we are loading the content...
Similar Documents
A simple mathematical model of adaptive routing in wormhole k-ary n-cubes (2002)
| Content Provider | CiteSeerX |
|---|---|
| Author | Sarbazi-Azad, H. Ould-Khaoua, M. |
| Description | Many fully-adaptive algorithms have been proposed for k-ary n-cubes over the past decade. The performance characteristics of most of these algorithms have been analysed by means of software simulation only. This paper proposes a simple yet reasonably accurate analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. This model requires a running time of O(I) which is the fastest model yet reported in the literature while maintaining reasonable accuracy. 1. |
| File Format | |
| Language | English |
| Publisher Date | 2002-01-01 |
| Publisher Institution | In: Proc ACM SACÕ2002 |
| Access Restriction | Open |
| Subject Keyword | Software Simulation Wormhole K-ary N-cubes Adaptive Routing Accurate Analytical Model Past Decade Message Latency Reasonable Accuracy K-ary N-cubes Wormhole-routed K-ary N-cubes Many Fully-adaptive Algorithm Running Time Performance Characteristic Simple Mathematical Model |
| Content Type | Text |
| Resource Type | Article |
