A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Two Ranking Schemes for Efficient Computation on the Star Interconnection Network
IEEE Transactions on Parallel and Distributed Systems
Fault Tolerance Properties of Pyramid Networks
IEEE Transactions on Computers
Algorithmic construction of Hamiltonians in pyramids
Information Processing Letters
Fault-Tolerant Ring Embedding in a Star Graph with Both Link and Node Failures
IEEE Transactions on Parallel and Distributed Systems
On the VLSI Area and Bisection Width of Star Graphs and Hierarchical Cubic Networks
IPDPS '01 Proceedings of the 15th International Parallel & Distributed Processing Symposium
Local diagnosability of generic star-pyramid graph
Information Processing Letters
| Hi-index | 0.00 |
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, 1i ≤ 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.