THE COST OF BROADCASTING ON STAR GRAPHS AND KAPPA-ARY HYPERCUBES

Authors
GRAHAM SW SEIDEL SR
Citation
Sw. Graham et Sr. Seidel, THE COST OF BROADCASTING ON STAR GRAPHS AND KAPPA-ARY HYPERCUBES, I.E.E.E. transactions on computers, 42(6), 1993, pp. 756-759
Citations number
10
Categorie Soggetti
Computer Sciences","Engineering, Eletrical & Electronic","Computer Applications & Cybernetics
Journal title
I.E.E.E. transactions on computers → ACNP
ISSN journal
00189340
Volume
42
Issue
6
Year of publication
1993
Pages
756 - 759
Database
ISI
SICI code
0018-9340(1993)42:6<756:TCOBOS>2.0.ZU;2-7
Abstract
It is shown that, for two common broadcasting problems, a star graph p erforms better than a k-ary hypercube with a comparable number of node s only in networks consisting of 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 ea ch network. 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 degre e.