Abstract
In a multiprocessor network, sending a packet typically refers to start-up time and transmission time. To optimize these two times, as opposed to earlier solutions, a spanning tree and multiple spanning trees are constructed to solve four types of broadcasting problems in an (n, k)-star graph: one-to-all or all-to-all broadcasting with either one-port or all-port communication model, respectively. Since the proposed spanning tree has an optimal height, both one-to-all and all-to-all broadcasting algorithms achieve nearly optimal start-up time and transmission time under all-port model and one-port model, and optimal transmission time under one-port model. By using multiple spanning trees, both one-to-all and all-to-all algorithms achieve nearly optimal transmission time under all-port model and one-port model.
Chapter PDF
Similar content being viewed by others
Keywords
References
Chiang, W.K., Chen, R.J.: The (n, k)-star graph: A generalized star graph. Information Proc. Let. 56, 259–264 (1995)
Chiang, W.K., Chen, R.J.: Topological Properties of the (n, k)-star graph. International Journal of Foundations of Computer Science 9(2), 235–248 (1998)
Chang, J.-H., Kim, J.: Ring Embedding in Faulty (n, k)-star graphs. In: ICPADS 2001. Proceedings of the Eighth International Conference on Parallel and Distributed Systems, pp. 99–106 (2001)
Chen, Y.-S., Tai, K.-S.: A Near-Optimal Broadcasting in (n, k)-star graphs. In: SNPD 2000. ACIS Int’l Conf on Software Engineering Applied to Networking and Parallel/Distributed Computing, pp. 217–224 (2000)
Johnsson, S.L., Ho, C.T.: Optimal Broadcasting and Personalized Communication in Hypercubes. IEEE Trans. Computers 38(9), 1249–1268 (1989)
Tseng, Y.-C., Sheu, J.-P.: Toward Optimal Broadcast in a star graph Using Multiple Spanning Tree. IEEE Trans. Computers 46(5), 593–599 (1997)
Li, J.L., Xiang, Y.H., Chen, M.L., Zhou, Y.H.: An Optimal Spanning Tree in (n, k)-star graph Network. Microelectronics and Computer 23(9), 168–170 (2006)
Chen, Y.S., Juang, T.Y.: Efficient Broadcasting in an Arrangement Graph Using Multiple Spanning Trees. IEICE Tans. Fundamentals E83-A(1), 139–149 (2000)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 IFIP International Federation for Information Processing
About this paper
Cite this paper
Li, J., Chen, M., Xiang, Y., Yao, S. (2007). Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees. In: Li, K., Jesshope, C., Jin, H., Gaudiot, JL. (eds) Network and Parallel Computing. NPC 2007. Lecture Notes in Computer Science, vol 4672. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74784-0_23
Download citation
DOI: https://doi.org/10.1007/978-3-540-74784-0_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74783-3
Online ISBN: 978-3-540-74784-0
eBook Packages: Computer ScienceComputer Science (R0)