Loading...

Performance modelling of necklace hypercubes

Meraji, S ; Sharif University of Technology | 2007

259 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/IPDPS.2007.370594
  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. Adaptive algorithms ; Computer simulation ; Cost effectiveness ; Network architecture ; Routing algorithms ; Topology ; VLSI circuits ; Necklace hypercube networks ; Performance modeling ; Topological properties ; Interconnection networks
  8. Source: 21st International Parallel and Distributed Processing Symposium, IPDPS 2007, Long Beach, CA, 26 March 2007 through 30 March 2007 ; 2007 ; 1424409101 (ISBN); 9781424409105 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/4228322