Loading...
A constraint-based performance comparison of hypercube and star multicomputers with failures
372 viewed

A constraint-based performance comparison of hypercube and star multicomputers with failures

Rezazad, M

A constraint-based performance comparison of hypercube and star multicomputers with failures

Rezazad, M ; Sharif University of Technology | 2005

372 Viewed
  1. Type of Document: Article
  2. DOI: 10.1109/AINA.2005.16
  3. Publisher: 2005
  4. Abstract:
  5. Many theoretical studies have compared the hypercube and star graphs from a graph theoretical viewpoint, under structural and algorithmic properties. None of these studies have, however, considered real working conditions and implementation constraints. In this paper, the hypercube and star graphs are compared in view of fault tolerance and technological implementation constraints. In order to realize a fair comparison, we use the unsafely-vector fault tolerant routing algorithm, recently introduced in [1] and [2], for the hypercube and star graph. Under two implementation constraints, namely constant bisection bandwidth and constant node pin-out, we have compared the performance of the two networks for different fault rates. The results obtained through simulation experiments reveal that, in the presence of low fault rates, the star graph is of better performance than the hypercube. © 2005 IEEE
  6. Keywords:
  7. Faulttolerant routing ; Hypercube ; Implementation constraints ; Multicomputers ; Performance comparison ; Star graph ; Algorithms ; Channel capacity ; Constraint theory ; Fault tolerant computer systems ; Graph theory ; Routers ; Interconnection networks
  8. Source: 19th International Conference on Advanced Information Networking and Applications, AINA 2005, Taipei, 28 March 2005 through 30 March 2005 ; Volume 1 , 2005 , Pages 841-846 ; 1550445X (ISSN); 0769522491 (ISBN); 9780769522494 (ISBN)
  9. URL: https://ieeexplore.ieee.org/document/1423593