“School of Computer Science”
Back to Papers HomeBack to Papers of School of Computer Science
| Paper IPM / Computer Science / 10907 |
|
||||||||
| Abstract: | |||||||||
|
Adaptive routing algorithms have been frequently suggested as a means of improving communication performance in parallel computer networks. These algorithms, unlike deterministic routing, can utilize network state information to exploit the presence of multiple paths. Before such schemes can be successfully incorporated in networks, it is necessary to have a clear understanding of the factors which affect their performance potential. This paper proposes a new analytical model to obtain message latency in wormhole-switched 2-D torus interconnect networks. The analysis focuses on a fully adaptive routing which has been shown to be one of the most effective in torus networks. The validity of the model is demonstrated by comparing analytical results with those obtained through simulation experiments.
Download TeX format |
|||||||||
| back to top | |||||||||
