A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks

  • Authors:

  • Nen-Chung Wang;Chih-Ping Chu;Tzung-Shi Chen

  • Affiliations:

  • Department of Information and Communication Engineering, Chaoyang University of Technology, Taichung 413, Taiwan, ROC;Department of Computer Science and Information Engineering, National Cheng Kung University, Tainan 701, Taiwan, ROC;Department of Information Management, Chang Jung University, Tainan 711, Taiwan, ROC

  • Venue:
  • Journal of Parallel and Distributed Computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.02

Visualization

Abstract

Multicast is an important collective communication operation on multicomputer systems, in which 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 first address a dual-hamiltonian-path-based routing model with two virtual channels based on two hamiltonian paths (HPs) and a network partitioning strategy for wormhole-routed star graph networks. Then, we propose three efficient multicast routing schemes on basis of such a model. All of the three proposed schemes are proved deadlock-free. The first scheme, network-selection-based dual-path routing, selects subnetworks that are constructed either by the first HP or by the second HP for dual-path routing. The second one, optimum dual-path routing, selects subnetworks with optimum routing path for dual-path routing. The third scheme, two-phase optimum dual-path routing, includes two phases, source-to-relay and relay-to-destination. Finally, experimental results are given to show that our proposed three routing schemes outperform the unicast-based, the HP, and the single-HP-based dual-path routing schemes significantly.