Loading...

The star-pyramid graph: An attractive alternative to the pyramid

Imani, N ; Sharif University of Technology | 2005

134 Viewed
  1. Type of Document: Article
  2. DOI: 10.1007/11572961_41
  3. Publisher: 2005
  4. Abstract:
  5. This paper introduces a new class of interconnection networks named Star-Pyramid, SP(n). A star-pyramid of dimension n is formed by piling up star graphs of dimensions 1 to n in a hierarchy, connecting any node in each i-dimensional star, 1< i ≤ n, to a node in (i - 1)-star whose index is reached by removing the i symbol from the index of the former node in the i-star graph. Having extracted the properties of the new topology, featuring topological properties, a simple routing algorithm and Hamiltonicity then we compare the network properties of the proposed topology and the well-known pyramid topology. We show that the star-pyramid is more fault-tolerant and has less network diameter than its alternative, the pyramid. Finally, we propose a variant of star-pyramid, namely the generic star-pyramid as a topology with better scalability, fault-tolerance, and diameter. © Springer-Verlag Berlin Heidelberg 2005
  6. Keywords:
  7. Algorithms ; Fault tolerant computer systems ; Graph theory ; Hamiltonians ; Routers ; Topology ; Pyramid topology ; Routing algorithm ; Star-pyramid graph ; Interconnection networks
  8. Source: 10th Asia-Pacific Conference on Advances in Computer Systems Architecture, ACSAC 2005, Singapore, 24 October 2005 through 26 October 2005 ; Volume 3740 LNCS , 2005 , Pages 509-519 ; 03029743 (ISSN); 3540296433 (ISBN); 9783540296430 (ISBN)
  9. URL: https://link.springer.com/chapter/10.1007/11572961_41