By Topic

Analytical performance comparison of deterministic, partially- and fully-adaptive routing algorithms in binary n-cubes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Patooghy, A. ; IPM Sch. of Comput. Sci., Sharif Univ. of Technol., Tehran ; Sarbazi-Azad, H.

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

Published in:

Parallel and Distributed Systems, 2006. ICPADS 2006. 12th International Conference on  (Volume:2 )

Date of Conference:

0-0 0