loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth International Conference on Parallel and Distributed Systems (ICPADS'02)
Dual-Hamiltonian-Path-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks
Taiwan, ROC
December 17-December 20
ISBN: 0-7695-1760-9
Nen-Chung Wang, Chaoyang University of Technology
Chih-Ping Chu, National Cheng Kung University
Tzung-Shi Chen, Chang Jung University
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 (DHPB) routing model with two virtual channels based on two hamiltonian paths 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. The proposed schemes are network-selection-based (NSB), heuristic-network- selection-based (HNSB), and two-phase heuristic-network- selection-based (TP-HNSB) dual-path routing. All of the three proposed schemes are deadlock-free. Finally, experimental results are given to show our proposed three routing schemes outperform the unicast-based, the hamiltonian-path, and the single-hamiltonian-path-based (SHPB) dual-path routing schemes significantly.
Index Terms:
Multicast, path-based routing, star graphs, virtual channels, wormhole routing.
Citation:
Nen-Chung Wang, Chih-Ping Chu, Tzung-Shi Chen, "Dual-Hamiltonian-Path-Based Multicasting on Wormhole-Routed Star Graph Interconnection Networks," icpads, pp.17, Ninth International Conference on Parallel and Distributed Systems (ICPADS'02), 2002
Usage of this product signifies your acceptance of the Terms of Use.