Optimal routing and multicasting in wormhole-routed honeycomb networks

Author

Song, Jianping ; Hou, Zifeng ; Shi, Yuntao

Author_Institution

Inst. of Comput. Technol., Acad. Sinica, China

Volume

1

fYear

2000

fDate

14-17 May 2000

Firstpage

142

Abstract

The authors first present a deadlock-free routing algorithm in honeycomb networks. Based on the routing algorithm, we develop a minimum-time multicast algorithm in one-port wormhole-routed honeycomb meshes, in the absence of hardware multicast support. By exploiting the properties of the switching technology and the use of virtual channels, the algorithm can deliver a multicast message to m-1 destinations in [log/sub 2/ m] message-passing steps, while avoiding contention among the constituent unicast messages.

Keywords

message passing; multicast communication; multiprocessor interconnection networks; network routing; switching theory; constituent unicast messages; contention; deadlock-free routing algorithm; hardware multicast support; message-passing steps; minimum-time multicast algorithm; multicast message; multicasting; one-port wormhole-routed honeycomb meshes; optimal routing; routing algorithm; switching technology; virtual channels; wormhole-routed honeycomb networks;

fLanguage

English

Publisher

ieee

Conference_Titel

High Performance Computing in the Asia-Pacific Region, 2000. Proceedings. The Fourth International Conference/Exhibition on

Conference_Location

Beijing, China

Print_ISBN

0-7695-0589-2

Type

conf

DOI

10.1109/HPC.2000.846535

Filename

846535