Institute of Computing Technology, Chinese Academy IR
| An optimal multicast algorithm for cube-connected cycles | |
| Song, JP; Hou, ZF; Shi, YT | |
| 2000-11-01 | |
| 发表期刊 | JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY
![]() |
| ISSN | 1000-9000 |
| 卷号 | 15期号:6页码:572-583 |
| 摘要 | 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 minimum-time 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 inverted right perpendicular log(2) m inverted left perpendicular 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. |
| 关键词 | multicast cube-connected cycle wormhole routing dimension-ordered routing one-port architecture |
| 收录类别 | SCI |
| 语种 | 英语 |
| WOS研究方向 | Computer Science |
| WOS类目 | Computer Science, Hardware & Architecture ; Computer Science, Software Engineering |
| WOS记录号 | WOS:000165284800007 |
| 出版者 | SCIENCE PRESS |
| 引用统计 | |
| 文献类型 | 期刊论文 |
| 条目标识符 | http://119.78.100.204/handle/2XEOYT63/13361 |
| 专题 | 中国科学院计算技术研究所期刊论文_英文 |
| 通讯作者 | Song, JP |
| 作者单位 | Chinese Acad Sci, Inst Comp Technol, Beijing 100080, Peoples R China |
| 推荐引用方式 GB/T 7714 | Song, JP,Hou, ZF,Shi, YT. An optimal multicast algorithm for cube-connected cycles[J]. JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,2000,15(6):572-583. |
| APA | Song, JP,Hou, ZF,&Shi, YT.(2000).An optimal multicast algorithm for cube-connected cycles.JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY,15(6),572-583. |
| MLA | Song, JP,et al."An optimal multicast algorithm for cube-connected cycles".JOURNAL OF COMPUTER SCIENCE AND TECHNOLOGY 15.6(2000):572-583. |
| 条目包含的文件 | 条目无相关文件。 | |||||
除非特别说明,本系统中所有内容都受版权保护,并保留所有权利。
修改评论