Loading...

Comparative analytical performance evaluation of adaptivity in wormhole-switched hypercubes

Patooghy, A ; Sharif University of Technology | 2007

268 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/j.simpat.2006.11.007
  3. Publisher: 2007
  4. Abstract:
  5. In this paper, we study the effect of adaptivity of the routing algorithm on the overall performance of 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 the hypercube. We compare these three different classes of routing algorithms under different working conditions and structural factors. It is widely believed that the level of adaptivity can result in better performance. Our analysis shows that under uniform traffic load, the employed partially-adaptive routing algorithm exhibits a lower performance compared to the considered deterministic routing algorithm. © 2006 Elsevier B.V. All rights reserved
  6. Keywords:
  7. Adaptive algorithms ; Routing algorithms ; Switching systems ; Telecommunication traffic ; Adaptive routing ; Deterministic routing ; Network based systems ; Routing adaptivity ; Traffic unbalance ; Hypercube networks
  8. Source: Simulation Modelling Practice and Theory ; Volume 15, Issue 4 , 2007 , Pages 400-415 ; 1569190X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S1569190X06001055