An optimal multicast algorithm for cube-connected cycles |
| |
Authors: | Jianping Song Zifeng Hou Yuntao Shi |
| |
Affiliation: | (1) Institute of Computing Technology, Chinese Academy of Sciences, 100080 Beijing, P.R. China |
| |
Abstract: | This paper presents an efficient algorithm that implements one to-many, or multicast, communication in one-port wormhole-routed cube-connected cycles (CCCs) in the absence of hardware multicast support. By exploiting the properties of the switching technology and the use of virtual channels, a minimumtime multicast algorithm is presented for n-dimensional CCCs that use deterministic routing of unicast messages. The algorithm can deliver a multicast message to m - 1 destinations in log2, m] message-passing steps, while avoiding contention among the constituent unicast messages. Performance results of a simulation study on CCCs with up to 10,240 nodes are also given. |
| |
Keywords: | multicast cube-connected cycle wormhole routing dimensionordered routing one-port architecture |
本文献已被 CNKI 维普 万方数据 SpringerLink 等数据库收录! |
| 点击此处可从《计算机科学技术学报》浏览原始摘要信息 |
|
点击此处可从《计算机科学技术学报》下载全文 |