Topological Properties of Hypercubes
IEEE Transactions on Computers
A Group-Theoretic Model for Symmetric Interconnection Networks
IEEE Transactions on Computers
Optimum Broadcasting and Personalized Communication in Hypercubes
IEEE Transactions on Computers
The Cross Product of Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Matrix Decomposition on the Star Graph
IEEE Transactions on Parallel and Distributed Systems
Fault Diameter of k-ary n-cube Networks
IEEE Transactions on Parallel and Distributed Systems
Optimal Parallel Routing in Star Networks
IEEE Transactions on Computers
Generating a deterministic task migration path for multiprocessor scheduling
SAC '94 Proceedings of the 1994 ACM symposium on Applied computing
Neighborhood Information Dissemination in the Star Graph
IEEE Transactions on Computers
On the Performance of Parallel Matrix Factorisation on the Hypermesh
The Journal of Supercomputing
Reliable Communication in Faulty Star Networks
IPDPS '02 Proceedings of the 16th International Parallel and Distributed Processing Symposium
On the topological properties of the arrangement-star network
Journal of Systems Architecture: the EUROMICRO Journal
Node-ranking schemes for the star networks
Journal of Parallel and Distributed Computing
Mathematical performance modelling of stretched hypercubes
ICDCN'08 Proceedings of the 9th international conference on Distributed computing and networking
Efficient routing algorithms on optoelectronic networks
TELE-INFO'06 Proceedings of the 5th WSEAS international conference on Telecommunications and informatics
| Hi-index | 14.99 |
It is shown that for two common broadcasting problems, a star graph performs better than a k-ary hypercube with a comparable number of nodes only in networks consisting of an impractically large numbers of nodes. This result is based on a comparison of the costs of known solutions to the one-to-all broadcast and the complete broadcast problems for each network. It is suggested that the cost of solutions to these common problems is a better indication of the expected performance of an interconnection network than is a comparison of scalar measures such as the diameter and degree.