Abstract
In this paper, we propose an algorithm for broadcasting in star graph using circuit-switched, half-duplex, and link-bound communication. By using the algorithm, we show that the broadcasting in an n-dimensional star graph can be done in n-1 time steps. We also study the lower bound of time steps of the circuit-switched broadcasting in star graph, and we prove that the optimal broadcasting time steps in an n-dimensional star graph is \(\lceil{\rm log}_{\rm n}{\it n}!\rceil\). Finally, the computational results showed that the proposed algorithm gets nearly optimal solutions.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
Akers, S.B., Harel, D., Krishnameurthy, B.: The star graph: an attractive alternative to the n-cube. In: International Conference on Parallel Processing, pp. 393–400 (1987)
Akers, S.B., Krishnameurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transactions on Computers 38(4), 555–566 (1989)
Day, K., Tripathi, A.: A comparative study of topological properties of hypercubes and star graphs. IEEE Transactions on Parallel and Distributed Systems 5(1), 31–38 (1994)
Qiu, K.: On some properties and algorithms for the star and pancake interconnection network. Journal of Parallel and Distributed Computing, 16–25 (1994)
Jwo, J.S., Lakshmivarahan, S., Dhall, S.K.: Embeddings of cycles and grids in star graphs. In: IEEE International Symposium on Parallel and Distributed Processing, pp. 540–547 (1990)
Nigam, M., Sahni, S., Krishnamurthy, B.: Embedding hamiltonians and hypercubes in star interconnection graphs. In: International Conference on Parallel processing, vol. 3, pp. 340–343 (1990)
Bagherzadeh, N., Nassif, N., Latifi, S.: A routing and broadcasting scheme on faulty star graphs. IEEE Transactions on Computers 42(11), 1398–1403 (1993)
Jovanovic, Z., Mišic, J.: Fault tolerance of the star graph interconnection network. Information Processing Letters 49(3), 145–150 (1994)
Latifi, S.: On the fault-diameter of the star graph. Information Processing Letters 46(3), 143–150 (1993)
latifi, S., Bagherzadeh, N.: Incomplete star: an incrementally scalable network based on the star graph. IEEE Transactions on Parallel and Distributed Systems 5(1), 97–102 (1994)
Hedtniemi, S.M., Hedetniemi, S.T., Liestman, A.L.: A survey of gossi** and broadcasting in communication networks. IEEE Networks 18(4), 319–349 (1988)
Fraigniaud, P., Lazard, E.: Methods and problems of communication in usual networks. Discrete Applied Mathematics 53(1-3), 79–133 (1994)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Lee, CT., Lin, YS. (2010). An Efficient Circuit–Switched Broadcasting in Star Graph. In: Hsu, CH., Yang, L.T., Park, J.H., Yeo, SS. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2010. Lecture Notes in Computer Science, vol 6082. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-13136-3_13
Download citation
DOI: https://doi.org/10.1007/978-3-642-13136-3_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-13135-6
Online ISBN: 978-3-642-13136-3
eBook Packages: Computer ScienceComputer Science (R0)