|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
 Digg  Furl  Spurl  Blink  Simpy  Google  Del.icio.us  Y!MyWeb | ||
| Search | ||
| ||
12th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'06)
Analytical Performance Comparison of Deterministic, Partially- and Fully-Adaptive Routing Algorithms in Binary n-Cubes
Minneapolis, Minnesota
July 12-July 15
ISBN: 0-7695-2612-8
| ASCII Text | x | ||
| A. Patooghy, H. Sarbazi-Azad, "Analytical Performance Comparison of Deterministic, Partially- and Fully-Adaptive Routing Algorithms in Binary n-Cubes," Parallel and Distributed Systems, International Conference on, vol. 2, pp. 21-28, 12th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'06), 2006. | |||
| BibTex | x | ||
| @article{ 10.1109/ICPADS.2006.27, author = {A. Patooghy and H. Sarbazi-Azad}, title = {Analytical Performance Comparison of Deterministic, Partially- and Fully-Adaptive Routing Algorithms in Binary n-Cubes}, journal ={Parallel and Distributed Systems, International Conference on}, volume = {2}, year = {2006}, issn = {1521-9097}, pages = {21-28}, doi = {http://doi.ieeecomputersociety.org/10.1109/ICPADS.2006.27}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - CONF JO - Parallel and Distributed Systems, International Conference on TI - Analytical Performance Comparison of Deterministic, Partially- and Fully-Adaptive Routing Algorithms in Binary n-Cubes SN - 1521-9097 SP21 EP28 A1 - A. Patooghy, A1 - H. Sarbazi-Azad, PY - 2006 KW - null VL - 2 JA - Parallel and Distributed Systems, International Conference on ER - | |||
In this paper, we study the effect of adaptivity of routing algorithm on the overall performance in a hypercube multicomputer using wormhole switching. To this end, we use three accurate analytical models proposed for deterministic, fully-adaptive, and partially-adaptive routing algorithms in hypercube. Surprisingly, our analysis shows that under uniform traffic load, the partially-adaptive routing exhibits a lower performance compared to the deterministic routing with less adaptivity.
Citation:
A. Patooghy, H. Sarbazi-Azad, "Analytical Performance Comparison of Deterministic, Partially- and Fully-Adaptive Routing Algorithms in Binary n-Cubes," icpads, vol. 2, pp.21-28, 12th International Conference on Parallel and Distributed Systems - Volume 2 (ICPADS'06), 2006
Usage of this product signifies your acceptance of the Terms of Use.