Multicast communication in wormhole-routed 2D torus networks with hamiltonian cycle model

被引：7

作者：

Wang, Neng-Chung ^{[1
]}

Hung, Yi-Ping ^{[2
]}

机构：

[1] Natl United Univ, Dept Comp Sci & Informat Engn, Miaoli 360, Taiwan

[2] Chaoyang Univ Technol, Dept Comp Sci & Informat Engn, Taichung 413, Taiwan

来源：

JOURNAL OF SYSTEMS ARCHITECTURE | 2009年 / 55卷 / 01期

关键词：

Hamiltonian cycle; Multicast; Parallel computing; Torus networks; Wormhole routing;

D O I：

10.1016/j.sysarc.2008.09.002

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we propose an efficient multipath multicast routing algorithm in wormhole-routed 2D torus networks. We first introduce a hamiltonian cycle model for exploiting the feature of torus networks. Based on this model, we find a hamiltonian cycle in torus networks. Then, an efficient multipath multicast routing algorithm with hamiltonian cycle model (mulitpath-HCM) is presented. The proposed multipath multicast routing algorithm utilizes communication channels more uniformly in order to reduce the path length of the routing messages, making the multicasting more efficient. Simulation results show that the multicast latency of the proposed multipath-HCM routing algorithm is Superior to that of fixed and dual-path routing algorithms. (c) 2008 Elsevier B.V. All rights reserved.

引用

页码：70 / 78

页数：9