### 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 | Spain |

City | Madrid |

Period | 3/11/02 → 3/14/02 |

### Fingerprint

### Keywords

- Adaptive routing
- Interconnection networks
- k-Ary n-cubes
- Performance modelling
- Wormhole switching

### ASJC Scopus subject areas

- Computer Science(all)

### Cite this

*Proceedings of the ACM Symposium on Applied Computing*(pp. 835-839)

**A simple mathematical model of adaptive routing in wormhole k-ary n-cubes.** / Sarbazi-Azad, H.; Ould-Khaoua, M.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

*Proceedings of the ACM Symposium on Applied Computing.*pp. 835-839, Applied Computing 2002: Proceeedings of the 2002 ACM Symposium on Applied Computing, Madrid, Spain, 3/11/02.

}

TY - GEN

T1 - A simple mathematical model of adaptive routing in wormhole k-ary n-cubes

AU - Sarbazi-Azad, H.

AU - Ould-Khaoua, M.

PY - 2002

Y1 - 2002

N2 - 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.

AB - 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.

KW - Adaptive routing

KW - Interconnection networks

KW - k-Ary n-cubes

KW - Performance modelling

KW - Wormhole switching

UR - http://www.scopus.com/inward/record.url?scp=0036039461&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0036039461&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:0036039461

SP - 835

EP - 839

BT - Proceedings of the ACM Symposium on Applied Computing

ER -