Many fully adaptive algorithms have been proposed in the literature over the past decade. The performance characteristics of most of these algorithms have been analyzed by means of software simulation only. This paper proposes an analytical model to predict message latency in wormhole-routed k-ary n-cubes with fully adaptive routing. The analysis focuses Duato's fully adaptive routing algorithm, which is widely accepted as the most general algorithm for achieving adaptivity in wormhole-routed networks while allowing for an efficient router implementation. The proposed model is general in that it exhibits a good degree of accuracy for various network sizes and under different operating conditions.
|Number of pages||15|
|Publication status||Published - Feb 2001|
ASJC Scopus subject areas
- Modelling and Simulation
- Hardware and Architecture
- Computer Networks and Communications