Abstract
Multicast communication is one of the general patterns of collective communication in multiprocessors. On hypercube network, the optimal multicast tree problem is NP-hard and all existing multicast algorithms are heuristic. And we find that the existing works are far away from optimal. So this paper aims to design an more efficient algorithm to reduce the communication traffic of multicast in hypercube network. We propose a clustering model and an efficient clustering multicast algorithm. Compared with the existing related works by simulation experiments, our heuristic algorithm reduces the communication traffic significantly.
Supported by PCSIRT (Program for Changjiang Scholars and Innovative Research Team in University) of China under Grant No. IRT0446.
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.
References
Lin, X., Ni, L.M.: Multicast communication in multicomputer networks. IEEE Trans. Parallel Distrib. Systems 4, 1105–1117 (1993)
Lan, Y., Esfahanian, A.H., Ni, L.M.: Multicast in hypercube multiprocessors. J. Parallel Distrib. Comput. 8, 30–41 (1990)
Shih-Hsien, S., Chang-Biau, Y.: Multicast Algorithms for Hypercube Multiprocessors. Journal of Parallel and Distributed Computing 61, 137–149 (2001)
Lan, Y., Esfahanian, A.H., Ni, L.M.: Distributed multi-destination routing in hypercube multiprocessors. In: Proceedings of the Third Conference on Hypercube Concurrent Computers and Applications, pp. 631–639 (1988)
Choi, Y., Esfahanian, A.H., Ni, L.M.: One-to-k communication in distributed-memory multiprocessors. In: Proc. 25th Annual Allerton Conference on Communication, Control, and Computing, pp. 268–270 (1987)
Dally, W.J., Towles, B.P.: Principles and Practices of Interconnection Networks. Morgan Kaufmann Publishers, San Francisco (2003)
Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers, San Francisco (2002)
Xu, J.: Topological structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)
Graham, R.L., Foulds, L.R.: Unlikelihood that minimal phylogenies for realistic biological study can be constructed in reasonable computational time. Math. Biosci. 60, 133–142 (1982)
Chen, J., Wang, G., Chen, S.: Locally subcube-connected hypercube networks: theoretical analysis and experimental results. IEEE Transactions on Computers 5, 530–540 (2002)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Song, L., BaoHua, F., Yong, D., XiaoDong, Y. (2006). Clustering Multicast on Hypercube Network. In: Gerndt, M., Kranzlmüller, D. (eds) High Performance Computing and Communications. HPCC 2006. Lecture Notes in Computer Science, vol 4208. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11847366_7
Download citation
DOI: https://doi.org/10.1007/11847366_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-39368-9
Online ISBN: 978-3-540-39372-6
eBook Packages: Computer ScienceComputer Science (R0)