Loading...

Simulation-based performance evaluation of deterministic routing in necklace hypercubes

Meraji, S ; Sharif University of Technology | 2007

240 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AICCSA.2007.370904
  3. Publisher: 2007
  4. Abstract:
  5. The necklace hypercube has recently been introduced as an attractive alternative to the well-known hypercube. Previous research on this network topology has mainly focused on topological properties, VLSI and algorithmic aspects of this network. Several analytical models have been proposed in the literature for different interconnection networks, as the most cost-effective tools to evaluate the performance merits of such systems. This paper proposes an analytical performance model to predict message latency in wormhole-switched necklace hypercube interconnection networks with fully adaptive routing. The analysis focuses on a fully adaptive routing algorithm which has been shown to be the most effective for necklace hypercube networks. The results obtained from simulation experiments confirm that the proposed model exhibits a good accuracy under different operating conditions. © 2007 IEEE
  6. Keywords:
  7. Mathematical models ; Routing algorithms ; Topology ; VLSI circuits ; Adaptive routing ; Message latency ; Necklace hypercubes ; Hypercube networks
  8. Source: 2007 IEEE/ACS International Conference on Computer Systems and Applications, AICCSA 2007, Amman, 13 May 2007 through 16 May 2007 ; June , 2007 , Pages 343-350 ; 1424410312 (ISBN); 9781424410316 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4230979