A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
The twisted cube topology for multiprocessors: a study in network asymmetry
Journal of Parallel and Distributed Computing
A Variation on the Hypercube with Lower Diameter
IEEE Transactions on Computers
Comments on "Hierarchical Cubic Networks"
IEEE Transactions on Parallel and Distributed Systems
A Unified Formulation of Honeycomb and Diamond Networks
IEEE Transactions on Parallel and Distributed Systems
Constructing One-to-Many Disjoint Paths in Folded Hypercubes
IEEE Transactions on Computers
Topological properties of folded hyper-star networks
The Journal of Supercomputing
X-torus: a variation of torus topology with lower diameter and larger bisection width
ICCSA'06 Proceedings of the 2006 international conference on Computational Science and Its Applications - Volume Part V
One-to-many node-disjoint paths of hyper-star networks
Discrete Applied Mathematics
| Hi-index | 0.00 |
In this paper, we introduce the hyper-star graph HS(n, k) as a new interconnection network, and discuss its properties such as faulttolerance, scalability, isomorphism, routing algorithm, and diameter. A hyper-star graph has merits when degree × diameter is used as a desirable quality measure of an interconnection network because it has a small degree and diameter. We also introduce a variation of HS(2k, k), folded hyper-star graphs FHS(2k, k) to further improve the cost degree × diameter of a hypercube: when FHS(2k, k) and an n-dimensional hypercube have the same number of nodes, degree × diameter of FHS(2k, k) is less than (k +1)(⌈logK⌉+1) whereas a hypercube is n2, where K = 2k/ k). It shows that FHS(2k, k) is superior to a hypercube and its variations in terms of the cost, degree × diameter.