Loading...

A mathematical model of deterministic wormhole routing in hypercube multicomputers using virtual channels

Sarbazi Azad, H ; Sharif University of Technology | 2003

136 Viewed
  1. Type of Document: Article
  2. DOI: 10.1016/S0307-904X(03)00135-5
  3. Publisher: Elsevier Inc , 2003
  4. Abstract:
  5. Although several analytical models have been proposed in the literature for binary n-cubes with deterministic routing, most of them have not included the effects of virtual channel multiplexing on network performance. The only mathematical model for deterministic wormhole routing in hypercubes with virtual channels was proposed in [Y. Boura, Design and Analysis of Routing Schemes and Routers for Wormhole-routed Mesh Architectures, Ph.D. Thesis, Department of Computer Science and Engineering, Pennsylvania State University, 1995] which uses complex combinatorial analysis with a computation time of O(N = 2n) for an n-dimensional hypercube. This paper proposes a new and simple analytical model to compute message latency in binary n-cubes with virtual channels. It is very simple and easy to understand which uses an average case analysis and requires a computation time of O(n) for an n-dimensional hypercube. Results from simulation experiments confirm that the proposed model exhibits a good degree of accuracy for various network sizes and under different operating conditions. © 2003 Elsevier Inc. All rights reserved
  6. Keywords:
  7. Deterministic routing ; Hypercubes ; Interconnection networks ; Multicomputers ; Performance modelling ; Virtual channels
  8. Source: Applied Mathematical Modelling ; Volume 27, Issue 12 , 2003 , Pages 943-953 ; 0307904X (ISSN)
  9. URL: https://www.sciencedirect.com/science/article/pii/S0307904X03001355