A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
The HCN: a versatile interconnection network based on cubes
Proceedings of the 1989 ACM/IEEE conference on Supercomputing
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
Decomposing a star graph into disjoint cycles
Information Processing Letters
Information Processing Letters
On some properties and algorithms for the star and pancake interconnection networks
Journal of Parallel and Distributed Computing
Metacube: a new interconnection network for large scale parallel systems
CRPIT '02 Proceedings of the seventh Asia-Pacific conference on Computer systems architecture
Properties and Performance of Folded Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Optimal Broadcasting on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
A Comparative Study of Topological Properties of Hypercubes and Star Graphs
IEEE Transactions on Parallel and Distributed Systems
Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules
IEEE Transactions on Parallel and Distributed Systems
An oblivious shortest-path routing algorithm for fully connected cubic networks
Journal of Parallel and Distributed Computing
The new torus network design based On 3-dimensional hypercube
ICACT'09 Proceedings of the 11th international conference on Advanced Communication Technology - Volume 1
A class of hierarchical graphs as topologies for interconnection networks
Theoretical Computer Science
The Journal of Supercomputing
Mstar: a new two level interconnection network
ICDCIT'12 Proceedings of the 8th international conference on Distributed Computing and Internet Technology
| Hi-index | 0.00 |
We propose a new two level interconnection network topology, hierarchical star networks, HSn, that uses the star graphs as building blocks. Two level networks have been previously proposed that use hypercube and its variants as building blocks; it has been shown that these two level networks are superior to the networks, that are used as bnilding blocks, in terms of various performance metrics including diameter, cost, fault tolerance, fault diameter etc. Our results show that the proposed family of hierarchical star networks perform very competitively in comparison to star graphs; in addition, the proposed network outperforms all of the two level hierarchical networks proposed earlier that uses hypercubes (or its variations) as building blocks. Thus, our results further reinforce the notion that the star graphs are strong competitors of hypercubes for large multiprocessor design. We also investigate various topological properties of the network including embedding, mapping of parallel algorithms, fault tolerance and broadcasting algorithms.