OPTIMAL MULTICAST COMMUNICATION IN WORMHOLE-ROUTED TORUS NETWORKS

被引：32

作者：

ROBINSON, DF ^{[1
]}

MCKINLEY, PK ^{[1
]}

CHENG, BHC ^{[1
]}

机构：

[1] MICHIGAN STATE UNIV,DEPT COMP SCI,E LANSING,MI 48824

来源：

IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 1995年 / 6卷 / 10期

基金：

美国国家科学基金会;

关键词：

MULTICAST; WORMHOLE ROUTING; TORUS TOPOLOGY; VIRTUAL CHANNELS; ROUTING ALGORITHMS; DIMENSION-ORDERED ROUTING;

D O I：

10.1109/71.473513

中图分类号：

TP301 [理论、方法];

学科分类号：

081202 ;

摘要：

This paper presents efficient algorithms that implement one-to-many, or multicast, communication in wormhole-routed torus networks. By exploiting the properties of the snitching technology and the use of virtual channels, a minimum-time multicast algorithm is presented for n-dimensional torus networks that use deterministic, dimension-ordered routing of unicast messages. The algorithm can deliver a multicast message to m - 1 destinations in [log(2) m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on torus networks with up to 4096 nodes are also given.

引用

页码：1029 / 1042

页数：14

共 18 条

[1]

CHOI J, 1992, 4TH P S FRONT MASS P, P120

[2]

CHOI J, 1993, ORNLTM12309 TECH REP

[3]

CHOI J, 1993, ORNLTM12252 TECH REP

[4]

DALLY WJ, 1987, IEEE T COMPUT, V36, P547, DOI 10.1109/TC.1987.1676939