Abstract
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(1) which is the fastest model yet reported in the literature while maintaining reasonable accuracy.
| Original language | English |
|---|---|
| Title of host publication | Proceedings of the ACM Symposium on Applied Computing |
| Pages | 835-839 |
| Number of pages | 5 |
| Publication status | Published - 2002 |
| Event | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing - Madrid, Spain Duration: Mar 11 2002 → Mar 14 2002 |
Other
| Other | Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing |
|---|---|
| Country/Territory | Spain |
| City | Madrid |
| Period | 3/11/02 → 3/14/02 |
Keywords
- Adaptive routing
- Interconnection networks
- k-Ary n-cubes
- Performance modelling
- Wormhole switching
ASJC Scopus subject areas
- General Computer Science