Loading...
| Friend's email | |
| Your name | |
| Your email | |
| enter code | |
This page was sent successfuly
187 viewed
Analytic performance modeling of a fully adaptive routing algorithm in the torus
Rezazad, M
Analytic performance modeling of a fully adaptive routing algorithm in the torus
Rezazad, M ; Sharif University of Technology | 2005
187
Viewed
- Type of Document: Article
- DOI: 10.1007/11576235_98
- Publisher: 2005
- Abstract:
- Over the past decade, many fully adaptive routing algorithms have been proposed in the literature, of which Duato's routing algorithm has gained considerable attention for analytical modeling. In this study we propose an analytical model to predict message latency in wormhole routed 2-dimensional torus networks in which fully adaptive routing, based on Linderr-Harden's methodology [10], is employed. This methodology presents a framework in which adaptive routing algorithms can be developed for the k-ary n-cube network. Simulation experiments reveal that the latency results predicted by the proposed analytical model are in good agreement with those provided by simulation experiments. © Springer-Verlag Berlin Heidelberg 2005
- Keywords:
- Computer networks ; Computer simulation ; Mathematical models ; Routers ; Adaptive routing algorithms ; K-ary n-cube network ; Linderr-Harden's methodology ; Torus ; Adaptive algorithms
- Source: 3rd International Symposium on Parallel and Distributed Processing and Applications, ISPA 2005, Nanjing, 2 November 2005 through 5 November 2005 ; Volume 3758 LNCS , 2005 , Pages 984-989 ; 03029743 (ISSN); 3540297693 (ISBN); 9783540297697 (ISBN)
- URL: https://link.springer.com/chapter/10.1007/11576235_98
