Skip to main content
SpringerLink
Log in

An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path

  • Published:
The Journal of Supercomputing Aims and scope Submit manuscript

Abstract

Multicasting is an important issue for numerous applications in parallel and distributed computing. In multicasting, the same message is delivered from a source node to an arbitrary number of destination nodes. The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we propose an efficient and deadlock-free tree-based multi-cast routing scheme for wormhole-routed star graph networks with hamiltonian path. In our proposed routing scheme, the router is with the input-buffer-based asynchronous replication mechanism that requires extra hardware cost. Meanwhile, the router simultaneously sends incoming flits on more than one outgoing channel. We perform simulation experiments with the network latency and the network traffic. Experimental results show that the proposed scheme reduces multicast latency more efficiently than other schemes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. S. B. Akers, D. Harel, and B. Krishnamurthy. The star graph: An attractive alternative to the n-cube. In Proceedings of the 1987 International Conference on Parallel Processing, pp. 393–400, Aug. 1987.

  2. S. B. Akers and B. Krishnamurthy. A group-theoretic model for symmetric interconnection networks. IEEE Trans , on Computers, 38(4):555–565, 1989.

    Google Scholar 

  3. H. R. Arabnia and S. M. Bhandarkar. Parallel stereocorrelation on a reconfigurable multi-ring network. The Journal of Supercomputing, Special Issue on Parallel and Distributed Processing, 10(3):243–269, 1996.

    Google Scholar 

  4. S. M. Bhandarkar and H. R. Arabnia. The REFINE multiprocessor—theoretical properties and algorithms. Parallel Computing, 21(11):1783–1805, 1995.

    Article  Google Scholar 

  5. S. M. Bhandarkar and H. R. Arabnia. Parallel computer vision on a reconfigurable multiprocessor network. IEEE Trans. on Parallel and Distributed Systems, 8(3):292–309, 1997.

    Article  Google Scholar 

  6. T.-S. Chen, N.-C. Wang, and C.-P. Chu. Multicast communication in wormhole-routed star graph interconnection networks. Parallel Computing, 26(11):1459–1490, 2000.

    Article  MathSciNet  Google Scholar 

  7. L. D. Coster, N. Dewulf, and C. T. Ho. Efficient multi-packet multicast algorithms on meshes with wormhole and dimension-ordered routing. In Processdings of International Conference on Parallel Processing, Vol. Ill, pp. 137–141, Aug. 1995.

    Google Scholar 

  8. W. J. Dally and C. L. Seitz. Deadlock-free message routing in multiprocessor interconnection networks. IEEE Trans. on Computers, C-36(5):547–553, 1987.

    Google Scholar 

  9. J. Duato, S. Yalamanchili, and L. M. Ni. Interconnection Networks: An Engineering Approach.Computer Society Press, 1997.

  10. K.-P. Fan and C.-T. King. Turn grouping for multicast in wormhole-roued mesh networks supporting the turn model. The Journal of Supercomputing, 16(3):237–260, 2000.

    Article  Google Scholar 

  11. P. Kermani and L. Kleinrock. Virtual cut-through: A new computer communication switching technique. Computer Networks, 3(4):267–286, 1979.

    Article  Google Scholar 

  12. Y. Lan, A. H. Esfahanian, and L. M. Ni. Multicast in hypercube multiprocessors. Journal of Parallel and Distributed Computing, 8(1):30–41, 1990.

    Article  Google Scholar 

  13. R. Libeskind-Hadas, D. Mazzoni, and R. Rajagopalan. Tree-based multicasting in wormhole-routed irregular topologies. In Proceedings of the Merged Twelfth International Parallel Processing Symposium and the Ninth Symposium on Parallel and Distributed Processing, April 1998.

  14. X. Lin, P. K. McKinley, and L. M. Ni. Deadlock-free multicast wormhole routing in 2D mesh mul-ticomputers. IEEE Trans. on Parallel and Distributed Systems, 5(8):793–804, 1994.

    Article  Google Scholar 

  15. M. P. Malumbres and J. Duato. An efficient implementation of tree-based multicast routing for distributed shared-memory multiprocessors. Journal of Systems Architecture, 46(11):1019–1032, 2000.

    Article  Google Scholar 

  16. P. K. McKinley, H. Xu, A. H. Esfahanianm, and L. M. Ni. Unicast-based multicast communication in wormhole-routed networks. IEEE Trans, on Parellel and Distributed Systems, 5(12):1252–1265, 1994.

    Google Scholar 

  17. P. K. McKinley, Y. J. Tsai, and D. F. Robinson. Collective communication in wormhole-routed massively parallel computers. Computer, 28(12):39–50, 1995.

    Article  Google Scholar 

  18. L. M. Ni and P. K. McKinley. A survey of wormhole routing techniques in direct networks. IEEE Computer, 26(2):62–76, 1993.

    Google Scholar 

  19. L. M. Ni. Should scable parallel computers support efficient hardware multicast? In Proceedings of the 1995 ICPP Workshop on Challenges for Parallel Processing, pp. 2–5, Aug. 1995.

  20. M. Nigam, S. Sahni, and B. Kirshnamurthy. Embedding hamiltonians and hypercubes in star interconnection graphs. In Proceedings of International Conference on Parallel Processing, Vol. 3, pp. 340–343, Aug. 1990.

    Google Scholar 

  21. D. K. Panda, S. Singal, and R. Kesavan. Multidestination message passing in wormhole k-ary n-cube networks with base routing conformed path. IEEE Trans. on Parellel and Distributed Systems, 10(1):76–96, 1999.

    Article  Google Scholar 

  22. D. F. Robinson, P. K. McKinley, and B. H. C. Cheng. Path-based multicast communication in wormhole-routed unidirectional torus networks. Journal of Parallel and Distributed Computing, 45(2):104–121, 1997.

    Article  Google Scholar 

  23. R. Sivaram, D. K. Panda, and C. B. Stunkel. Multicasting in irregular networks with cut-through switches using tree-based multidestination worms. In Proceedings of the 2nd Parallel Computing, Routing, and Communication Workshop (PCRCW’97). Atlanta, Georgia, pp. 35–48, June 1997.

  24. R. Sivaram, C. B. Stunkel, and D. K. Panda. Implementing multidestination worms in switch-based parallel systems: Architectural alternatives and their impact. IEEE Trans. on Parallel and Distributed Systems, 11(8):794–812, 2000.

    Article  Google Scholar 

  25. Y.-C. Tseng, D. K. Panda, and T.-H. Lai. A trip-based multicasting model for wormhole-routed networks with virtual channels. IEEE Trans, on Parallel and Distributed Systems, 7(2):138–150, 1996.

    Google Scholar 

  26. Y.-C. Tseng, M.-H. Yang, and T.-Y Juang. Achieving fault-tolerant multicast in injured wormhole-routed tori and meshes based on euler path construction. IEEE Trans, on Computers, 49(3):1282–1296, 2000.

    Google Scholar 

  27. N.-C. Wang, C.-P. Chu, and T.-S. Chen. A dual-hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks. Journal of Parallel and Distributed Computing, 62(12):1747–1762, 2002.

    Article  Google Scholar 

  28. Z. Zhou, W Shi, and Z. Tang. Efficient multidestination multicast on regular router-based networks. In Proceedings of the Fourth International Conference/Exhibition on High Performance Computing in Asia-Pacific Region (HPC Asia’2000), Vol. 1, pp. 82–87, May 2000.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Information Engineering, Chaoyang University of Technology, Taichung 413, Taiwan, R.O.C.

    Nen-Chung Wang

  2. Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan, R.O.C.

    Chih-Ping Chu

Authors
  1. Nen-Chung Wang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Chih-Ping Chu
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Nen-Chung Wang.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, NC., Chu, CP. An Efficient Tree-Based Multicasting Algorithm on Wormhole-Routed Star Graph Interconnection Networks Embedded with Hamiltonian Path. J Supercomput 34, 5–26 (2005). https://doi.org/10.1007/s11227-005-0258-3

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11227-005-0258-3

Keywords

Search

Navigation