This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs
June 1995 (vol. 6 no. 6)
pp. 653-658

Abstract—Based on the Mendia and Sarkar's algorithm [8], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an $n$-dimensional star graph, our algorithm takes $O(n\log_2 n)$ time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting $m$ packets in a pipeline fashion takes $O(m\log_2 n + n\log_2 n)$ time due to the nonredundant property of our broadcasting algorithm.

Index Terms—Broadcasting, interconnection networks, star graphs.

[1] S. B. Akers, D. Harel, and B. Krishnamurthy,“The star graph: An attractive alternative to the$n$-cube,”inProc. 1987 Int. Conf. Parallel Process.,Aug. 1987, pp. 393–400.
[2] S. B. Akers and B. Krishnamurthy,“A group-theoretic model for symmetric interconnection networks,”IEEE Trans. Comput.,vol. 38, pp. 555–565, Apr. 1989.
[3] S. G. Akl, K. Qiu, and I. Stojmenovic,“Fundamental algorithms for the star and pancake interconnection networks with applications to computational geometry,”Networks,vol. 23, no. 4, pp. 215–225, July 1993.
[4] R. Dechter and L. Kleinrock,“Broadcast communications and distributed algorithms,”IEEE Trans. Comput.,vol. 35, pp. 210–219, Mar. 1986.
[5] S. M. Hedetniemi, S. T. Hedetniemi, and A. L. Liestman,“A survey of gossiping and broadcasting in communication networks,”Networks,vol. 18, no. 4, pp. 319–349, 1988.
[6] S. L. Johnsson and C.-T. Ho,“Optimum broadcasting and personalized communication in hypercubes,”IEEE Trans. Comput.,vol. 38, pp. 1249–1268, Sept. 1989.
[7] X. Lin and L. M. Ni,“Multicast communication in multicomputer networks,”IEEE Trans. Parallel, Distrib. Syst.,vol. 4, pp. 1105–1117, Oct. 1993.
[8] V. E. Mendia and D. Sarkar,“Optimal broadcasting on the star graph,”IEEE Trans. Parallel, Distrib. Syst.,vol. 3, pp. 389–396, July 1992.
[9] J. P. Sheu, W. H. Liaw, and T. S. Chen,“A broadcasting algorithm in star graph interconnection networks,”inProc. 1992 Int. Conf. Parallel, Distribut. Syst.,Hsinchu, Taiwan, Dec. 1992, pp. 204–210.

Citation:
Jang-Ping Sheu, Chao-Tsung Wu, Tzung-Shi Chen, "An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 6, pp. 653-658, June 1995, doi:10.1109/71.388046
Usage of this product signifies your acceptance of the Terms of Use.