A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
On the fault-diameter of the star graph
Information Processing Letters
Optimal communication algorithms on star graphs using spanning tree constructions
Journal of Parallel and Distributed Computing
Broadcasting algorithms for the star-connected cycles interconnection network
Journal of Parallel and Distributed Computing
Macro-Star Networks: Efficient Low-Degree Alternatives to Star Graphs
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
Incomplete Star: An Incrementally Scalable Network Based on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
On excessive index of certain networks
Theoretical Computer Science
| Hi-index | 0.00 |
The star graph, though an attractive alternative to the hypercube, has a poor network bandwidth due to a lower number of channels compared to that in an equivalent hypercube. In order to alleviate this drawback, this paper presents a generalization of the star graph topology with a richer connectivity, called theenhanced-star. We also examine some topological properties of the proposed network. Some useful functions such as multi-node broadcasting, scattering, total exchange, and group communication, in the enhanced-star are also addressed. We show these operations can be completed faster in the enhanced-star (compared to the star).