DocumentCode
1052192
Title
The cost of broadcasting on star graphs and k -ary hypercubes
Author
Graham, Sidney W. ; Seidel, Steven R.
Author_Institution
Michigan Technol. Univ., Houghton, MI, USA
Volume
42
Issue
6
fYear
1993
fDate
6/1/1993 12:00:00 AM
Firstpage
756
Lastpage
759
Abstract
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
Keywords
hypercube networks; multiprocessor interconnection networks; broadcasting problems; interconnection network; k-ary hypercubes; performance; scalar measures; star graphs; Array signal processing; Broadcasting; Costs; Fault tolerance; Hypercubes; Multiprocessor interconnection networks; Notice of Violation; Signal processing algorithms; Systolic arrays; Very large scale integration;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/12.277296
Filename
277296
Link To Document