The Community for Technology Leaders
Green Image
<p><it>Abstract—</it>Based on the Mendia and Sarkar's algorithm [<ref type="bib" rid="D06538">8</ref>], we propose an optimal and nonredundant distributed broadcasting algorithm in star graphs. For an <math><tmath>$n$</tmath></math>-dimensional star graph, our algorithm takes <math><tmath>$O(n\log_2 n)$</tmath></math> time and guarantees that all nodes in the star graph receive the message exactly once. Moreover, broadcasting <math><tmath>$m$</tmath></math> packets in a pipeline fashion takes <math><tmath>$O(m\log_2 n + n\log_2 n)$</tmath></math> time due to the nonredundant property of our broadcasting algorithm.</p><p><it>Index Terms—</it>Broadcasting, interconnection networks, star graphs.</p>

C. Wu, T. Chen and J. Sheu, "An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs," in IEEE Transactions on Parallel & Distributed Systems, vol. 6, no. , pp. 653-658, 1995.
86 ms
(Ver 3.3 (11022016))