%0 Journal Article
%T An Optimal Multicast Algorithm for Cube-Connected Cycles
%A Song Jianping
%A HOU Zifeng
%A SHI Yuntao
%A <br>宋建平
%A 侯紫峰
%A 史云涛
%J 计算机科学技术学报
%D 2000
%I 
%X 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.
%K multicast
%K cube-connected cycle
%K wormhole routing
%K dimensionordered routing
%K one-port architecture<br>VLSI
%K 超大规模集成电路
%K 最佳算法
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=5B3AB970F71A803DEACDC0559115BFCF0A068CD97DD29835&cid=8240383F08CE46C8B05036380D75B607&jid=F57FEF5FAEE544283F43708D560ABF1B&aid=DAEF7C402F8003519C1915A4DB55B123&yid=9806D0D4EAA9BED3&vid=23CCDDCD68FFCC2F&iid=B31275AF3241DB2D&sid=2B25C5E62F83A049&eid=2B25C5E62F83A049&journal_id=1000-9000&journal_name=计算机科学技术学报&referenced_num=0&reference_num=19