Clustering Multicast on Hypercube Network

  • Lu Song
  • Fan BaoHua
  • Dou Yong
  • Yang XiaoDong
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4208)


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.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Lin, X., Ni, L.M.: Multicast communication in multicomputer networks. IEEE Trans. Parallel Distrib. Systems 4, 1105–1117 (1993)CrossRefGoogle Scholar
  2. 2.
    Lan, Y., Esfahanian, A.H., Ni, L.M.: Multicast in hypercube multiprocessors. J. Parallel Distrib. Comput. 8, 30–41 (1990)CrossRefGoogle Scholar
  3. 3.
    Shih-Hsien, S., Chang-Biau, Y.: Multicast Algorithms for Hypercube Multiprocessors. Journal of Parallel and Distributed Computing 61, 137–149 (2001)zbMATHCrossRefGoogle Scholar
  4. 4.
    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)Google Scholar
  5. 5.
    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)Google Scholar
  6. 6.
    Dally, W.J., Towles, B.P.: Principles and Practices of Interconnection Networks. Morgan Kaufmann Publishers, San Francisco (2003)Google Scholar
  7. 7.
    Duato, J., Yalamanchili, S., Ni, L.M.: Interconnection Networks: An Engineering Approach. Morgan Kaufmann Publishers, San Francisco (2002)Google Scholar
  8. 8.
    Xu, J.: Topological structure and Analysis of Interconnection Networks. Kluwer Academic Publishers, Dordrecht (2001)zbMATHGoogle Scholar
  9. 9.
    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)zbMATHCrossRefMathSciNetGoogle Scholar
  10. 10.
    Chen, J., Wang, G., Chen, S.: Locally subcube-connected hypercube networks: theoretical analysis and experimental results. IEEE Transactions on Computers 5, 530–540 (2002)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • Lu Song
    • 1
  • Fan BaoHua
    • 1
  • Dou Yong
    • 1
  • Yang XiaoDong
    • 1
  1. 1.College of Computer ScienceNational University of Defense TechnologyChangsha, HunanPeople’s Republic of China

Personalised recommendations