Loading...

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

Patooghy, A ; Sharif University of Technology | 2006

266 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/ICPADS.2006.27
  3. Publisher: 2006
  4. Abstract:
  5. 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. ©2006 IEEE
  6. Keywords:
  7. Adaptive algorithms ; Hypercube networks ; Switching ; Telecommunication traffic ; Hypercube multicomputer ; Uniform traffic load ; Wormhole switching ; Routing algorithms
  8. Source: 12th International Conference on Parallel and Distributed Systems, ICPADS 2006, Minneapolis, MN, 12 July 2006 through 15 July 2006 ; Volume 2 , 2006 , Pages 21-28 ; 15219097 (ISSN); 0769526128 (ISBN); 9780769526126 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1654597