DocumentCode
2258203
Title
Analytical performance comparison of deterministic, partially- and fully-adaptive routing algorithms in binary n-cubes
Author
Patooghy, A. ; Sarbazi-Azad, H.
Author_Institution
IPM Sch. of Comput. Sci., Sharif Univ. of Technol., Tehran
Volume
2
fYear
0
fDate
0-0 0
Abstract
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
Keywords
hypercube networks; multiprocessing systems; performance evaluation; binary n-cubes; deterministic routing algorithm; fully-adaptive routing algorithm; hypercube multicomputer; partially-adaptive routing algorithm; wormhole switching; Algorithm design and analysis; Analytical models; Hypercubes; Multiprocessor interconnection networks; Packet switching; Performance analysis; Routing; Switches; System recovery; Telecommunication network topology;
fLanguage
English
Publisher
ieee
Conference_Titel
Parallel and Distributed Systems, 2006. ICPADS 2006. 12th International Conference on
Conference_Location
Minneapolis, MN
ISSN
1521-9097
Print_ISBN
0-7695-2612-8
Type
conf
DOI
10.1109/ICPADS.2006.27
Filename
1654597
Link To Document