Abstract
The (n, k)-star graph is a generalization of the star graph. We first present an optimal neighbourhood broadcasting algorithm for the (n, k)-star, which is then used to develop an optimal broadcasting algorithm for it. Both algorithms are for the single-port model of the network. While our neighbourhood broadcasting is the first such algorithm designed for the network, our optimal O(log(n!/(n − k)!))-time (=O(k logn)) broadcasting algorithm improves previous algorithms with O(kn) running time. For the all-port model, we first identify a minimum dominating set for the (n, k)-star. We then use it to find an optimal broadcasting algorithm on the all-port model of the (n, k)-star. The running time of this algorithm matches those of previous ones but the algorithm is simpler by using a dominating set instead of spanning trees. In addition, the algorithm has no redundancy in that no node receives the same message more than once.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Akers, S.B., Krishnamurthy, B.: A Group Theoretic Model for Symmetric Interconnection Networks. IEEE Transactions on Computers c-38(4), 555–566 (1989)
Bermond, J.C., Ferreira, A., Pérennes, S., Peters, J.G.: Neighbourhood broadcasting in hypercubes, Technical Report, SFU-CMPT-TR 2004-12, School of Computing Science, Simon Fraser University, Canada
Chen, Y.S., Tai, K.S.: A Near-Optimal Broadcasting in (n, k)-Star Graphs. In: ACIS International Conference on Software Engineering Applied to Networking and Parallel/Distributed Computing (SNPD 2000), pp. 217–224 (2000)
Chiang, W.K., Chen, R.J.: The (n, k)-Star Graph: A Generalized Star Graph. Information Processing Letters 56, 259–264 (1995)
Chiang, W.K., Chen, R.J.: Topological Properties of (n, k)-Star Graph. International Journal of Foundations of Computer Science 9(2), 235–248 (1997)
Cosnard, M., Ferreira, A.: On the real power of loosely coupled parallel architectures. Parallel Processing Letters 1, 103–111 (1991)
Fujita, S.: Neighbourhood Information Dissemination in the Star Graph. IEEE Transaction on Computers 49(12), 1366–1370 (2000)
Fujita, S.: Optimal Neighborhood Broadcast in Star Graphs. Journal of Interconnection Networks 4(4), 419–428 (2003)
Katseff, H.P.: Incomplete Hypercubes. IEEE Trans. Compu. C-37(5), 604–608 (1988)
Latifi, S., Bagherzadeh, N.: Incomplete Star: An Incrementally Scalable Network Based on the Star Graph. IEEE Trans. on Parallel and Distributed System 5(1), 97–102 (1994)
Li, J.L., Chen, M.L., Xiang, Y.H., Yao, S.W.: Optimum Broadcasting Algorithms in (n, k)-Star Graphs Using Spanning Trees. In: Li, K., Jesshope, C., Jin, H., Gaudiot, J.-L. (eds.) NPC 2007. LNCS, vol. 4672, pp. 220–230. Springer, Heidelberg (2007)
Mendia, V.E., Sarkar, D.: Optimal Broadcasting on the Star Graph. IEEE Trans. on Parallel and Distributed System 3(4), 389–396 (1992)
Qiu, K., Das, S.K.: A Novel Neighbourhood Broadcasting Algorithm on Star Graphs. In: IEEE 9th International Conference on Parallel and Distributed Systems (ICPADS 2002), Taiwan, December 2002, pp. 37–41 (2002)
Qiu, K.: On a Unified Neighbourhood Broadcasting Scheme for Interconnection Networks. Parallel Processing Letters 17(4), 425–437 (2007)
Ravikumar, C.P., Kuchlous, A., Manimaran, G.: Incomplete Star Graph: An Economical Fault-Tolerant Interconnection Network. In: Proc. International Conference on Parallel Processing, vol. 1, pp. 83–90 (1993)
Sheu, J.P., Wu, C.T., Chen, T.S.: An Optimal Broadcasting Algorithm without Message Redundancy in Star Graphs. IEEE Transactions on Parallel and Distributed Systems 6(6), 653–658 (1995)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
He, L., Qiu, K., Shen, Z.Z. (2008). Neighbourhood Broadcasting and Broadcasting on the (n, k)-Star Graph. In: Bourgeois, A.G., Zheng, S.Q. (eds) Algorithms and Architectures for Parallel Processing. ICA3PP 2008. Lecture Notes in Computer Science, vol 5022. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69501-1_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-69501-1_9
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69500-4
Online ISBN: 978-3-540-69501-1
eBook Packages: Computer ScienceComputer Science (R0)