Skip to main content
SpringerLink
Log in

Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks

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

Abstract

The star graph interconnection network has been recognized as an attractive alternative to the popular hypercube network. In this paper, we present a multipath-based multicast routing model for wormholerouted star graph networks, propose two efficient multipath routing schemes, and contrast the performance of the proposed schemes with the performance of the scheme presented in our previous work. Both of the two proposed schemes have been proven to be deadlock-free. The first scheme, simple multipath routing, uses multiple independent paths for concurrent multicasting. The second scheme, two-phase multipath routing, includes two phases: source-to-relay and relay-to-destination. For each phase, multicasting is carried out using simple multipath routing. Experimental results show that, for short and medium messages with small message startup latencies, the proposed schemes reduce 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. Proceedings of the 1987 International Conference on Parallel Processing, Aug. 1987, pp. 393–400.

  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.

    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.

    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.

    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. Proceedings of International Conference on Parallel Processing, Aug. 1995, Vol. III, pp. 137–141.

    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. K.-P. Fan and C.-T. King. Turn grouping for multicast in wormhole-routed mesh networks supporting the turn model. The Journal of Supercomputing, 16(3):237–260, 2000.

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  17. 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.

    Google Scholar 

  18. 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 

  19. Y.-C. Tseng and J.-P. Sheu. Toward optimal broadcast in a star graph using multiple spanning trees. IEEE Trans. on Computers, 46(5):593–599, 1997.

    Google Scholar 

  20. 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 

Download references

Authors
  1. Neng-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

  3. Tzung-Shi Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

About this article

Cite this article

Wang, NC., Chu, CP. & Chen, TS. Multipath-Based Multicasting Strategies for Wormhole-Routed Star Graph Interconnection Networks. The Journal of Supercomputing 29, 265–286 (2004). https://doi.org/10.1023/B:SUPE.0000032781.99502.ac

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/B:SUPE.0000032781.99502.ac

Search

Navigation