This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
The Cost of Broadcasting on Star Graphs and k-ary Hypercubes
June 1993 (vol. 42 no. 6)
pp. 756-759

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.

[1] Y. Saad and M. Schultz, "Topological properties of hypercubes,"IEEE Trans. Comput., vol. 37, no. 7, pp. 867-871, July 1988.
[2] W. Dally and C. Seitz, "The torus routing chip," Dept. of Comput. Sci., California Inst. Technol., Tech. Rep. 5208:TR:86, Jan. 1986.
[3] D. Agrawal and L. Bhuyan, "Generalized hypercube and hyperbus structures for a computer network,"IEEE Trans. Comput., vol. C-33, no. 4, pp. 323-333, Apr. 1984.
[4] S. Lakshmivarahan and S. Dhall, "A new hierarchy of hypercube interconnection schemes for parallel computers,"J. Supercomputing, vol. 2, pp. 81-108, 1988.
[5] S. B. Akers and B. Krishnamurthy, "A group-theoretic model for symmetric interconnection networks,"IEEE Trans. Comput., vol. 38, no. 4, pp. 555-566, Apr. 1989.
[6] S. Johnsson and C. Ho, "Spanning graphs for optimum broadcasting and personalized communication in hypercubes,"IEEE Trans. Comput., vol. 38, no. 9, pp. 1249-1268, Sept. 1989.
[7] D. C. MacKenzie and S. R. Seidel, "Broadcasting on three multiprocessor interconnection topologies," Dept. Comput. Sci., Michigan Technol. Univ., Tech. Rep. CS-TR-89-01, Jan. 1989.
[8] B. Helminen and D. Poplawski, "A performance characterization of the FPS T-Series hypercube," Dept. Comput. Sci., Michigan Technol. Univ., Houghton, Tech. Rep. CS-TR-87-06, 1987.
[9] D. K. Bradley, "First and second generation hypercube performance," Dept. Comput. Sci., Univ. of Illinois, Tech. Rep. UIUCDCS-R-88-1455, Sept. 1988.
[10] D. A. Poplawski, "Node and communication performance of the Ametek Series 2010," Dept. Comput. Sci., Michigan Technol. Univ., Houghton, Tech. Rep. CS-TR-89-02, Feb. 1989.

Index Terms:
star graphs; k-ary hypercubes; broadcasting problems; performance; interconnection network.
Citation:
R. Hughey, "The Cost of Broadcasting on Star Graphs and k-ary Hypercubes," IEEE Transactions on Computers, vol. 42, no. 6, pp. 756-759, June 1993, doi:10.1109/12.277296
Usage of this product signifies your acceptance of the Terms of Use.