{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:30:25Z","timestamp":1759638625287},"reference-count":19,"publisher":"Springer Science and Business Media LLC","issue":"6","license":[{"start":{"date-parts":[[2000,11,1]],"date-time":"2000-11-01T00:00:00Z","timestamp":973036800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J. Comput. Sci. & Technol."],"published-print":{"date-parts":[[2000,11]]},"DOI":"10.1007\/bf02948839","type":"journal-article","created":{"date-parts":[[2008,9,13]],"date-time":"2008-09-13T00:26:39Z","timestamp":1221265599000},"page":"572-583","source":"Crossref","is-referenced-by-count":4,"title":["An optimal multicast algorithm for cube-connected cycles"],"prefix":"10.1007","volume":"15","author":[{"given":"Jianping","family":"Song","sequence":"first","affiliation":[]},{"given":"Zifeng","family":"Hou","sequence":"additional","affiliation":[]},{"given":"Yuntao","family":"Shi","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"5","key":"BF02948839_CR1","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1145\/358645.358660","volume":"24","author":"F P Preparata","year":"1981","unstructured":"Preparata F P, Vuillemin J. The cube-connected cycles: A versatile network for parallel computation.Comm. ACM, May 1981, 24(5): 300\u2013309.","journal-title":"Comm. ACM"},{"issue":"2","key":"BF02948839_CR2","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1109\/12.204798","volume":"42","author":"Nian-Feng Tzeng","year":"1993","unstructured":"Tzeng Nian-Feng. A cube-connected cycles architecture with high reliability and improved performance.IEEE Trans. Computers, Feb. 1993, 42(2): 246\u2013253.","journal-title":"IEEE Trans. Computers"},{"issue":"1","key":"BF02948839_CR3","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1006\/jpdc.1995.1032","volume":"25","author":"J Bruck","year":"1995","unstructured":"Bruck J, Cypher R, Ho C-T. On the construction of fault-tolerant cube-connected cycles networks.J. Parallel and distributed Computing, Feb, 1995, 25(1): 98\u2013106.","journal-title":"J. Parallel and distributed Computing"},{"issue":"8","key":"BF02948839_CR4","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1109\/71.706051","volume":"9","author":"R Klasing","year":"1998","unstructured":"Klasing R. Improved compressions of cube-connected cycles networks.IEEE Trans. Parallel and Distributed Systems, Aug. 1998, 9(8): 803\u2013812.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"10","key":"BF02948839_CR5","doi-asserted-by":"crossref","first-page":"1172","DOI":"10.1109\/71.246078","volume":"4","author":"D S Meliksetian","year":"1993","unstructured":"Meliksetian D S, Chen Roger C Y. Optimal routing algorithm and the diameter of the cube-connected cycles.IEEE Trans. Parallel and Distributed Systems, Oct. 1993, 4(10): 1172\u20131178.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"9","key":"BF02948839_CR6","first-page":"829","volume":"80-D","author":"Hao-yung Lo","year":"1997","unstructured":"Lo Hao-yung, Chen Jian-da. A routing algorithm and generalization for cube-connected cycle networks.IEICE Trans. Information and Systems, Sept. 1997, E80-D(9): 829\u2013836.","journal-title":"IEICE Trans. Information and Systems"},{"key":"BF02948839_CR7","doi-asserted-by":"crossref","unstructured":"McKinley P K, Xu FI, Kalms E, Ni L M. ComPaSS: Efficient communication services for scalable architectures. InProc. Supercomputing\u201992, Nov. 1992, pp.478\u2013487.","DOI":"10.1109\/SUPERC.1992.236656"},{"key":"BF02948839_CR8","doi-asserted-by":"crossref","unstructured":"Choi J, Dongarra J J, Pozo R, Walker D W. ScaLAPACK: A scalable linear algebra library for distributed memory concurrent computers. InProc. Fourth Symp. Frontiers of Massively Parallel Computation, IEEE CS Press, 1992, pp. 120\u2013127.","DOI":"10.1109\/FMPC.1992.234898"},{"key":"BF02948839_CR9","doi-asserted-by":"crossref","first-page":"973","DOI":"10.1016\/0167-8191(92)90011-U","volume":"18","author":"J Dongarra","year":"1992","unstructured":"Dongarra J, van de Geijn R A. Reduction to condensed form for the eigenvalue problem on distributed memory architectures.Parallel Computing, 1992, 18: 973\u2013982.","journal-title":"Parallel Computing"},{"issue":"12","key":"BF02948839_CR10","doi-asserted-by":"crossref","first-page":"1252","DOI":"10.1109\/71.334899","volume":"5","author":"P K McKinley","year":"1994","unstructured":"McKinley P K, Xu H, Esfahanian A-H, Ni L M. Unicast-based multicast communication in wormhole routed networks.IEEE Trans. Parallel and Distributed Systems, Dec 1994, 5(12): 1252\u20131265.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"10","key":"BF02948839_CR11","doi-asserted-by":"crossref","first-page":"1029","DOI":"10.1109\/71.473513","volume":"6","author":"D F Robinson","year":"1995","unstructured":"Robinson D F, McKinley P K, Cheng B H C. Optimal multicast communication in wormhole-routed torus networks.IEEE Trans. Parallel and Distributed Systems, Oct. 1995, 6(10): 1029\u20131042.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"6","key":"BF02948839_CR12","doi-asserted-by":"crossref","first-page":"597","DOI":"10.1109\/71.595577","volume":"8","author":"Hong Xu","year":"1997","unstructured":"Xu Hong, Gui Yadong, Lionel M Ni. Optimal software multicast in wormhole-routed multistage networks.IEEE Trans. Parallel and Distributed Systems, Jun. 1997, 8(6): 597\u2013607.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"9","key":"BF02948839_CR13","doi-asserted-by":"crossref","first-page":"988","DOI":"10.1109\/71.466635","volume":"6","author":"Y-Y Lee","year":"1995","unstructured":"Lee Y-Y, Wang S-D. Ring-connected networks and their relationship to cubical ring connected cycles and dynamic redundancy networks.IEEE Trans. Parallel and Distributed Systems, Sept. 1995, 6(9): 988\u2013996.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"3","key":"BF02948839_CR14","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1007\/BF01660031","volume":"1","author":"W J Dally","year":"1986","unstructured":"Dally W J, Seitz C L. The torus routing chip.J. Distributed Computing, 1986, 1(3): 187\u2013196.","journal-title":"J. Distributed Computing"},{"key":"BF02948839_CR15","first-page":"62","volume":"26","author":"L M Ni","year":"1993","unstructured":"Ni L M, McKinley P K. A survey of wormhole routing techniques in direct networks.IEEE Computer, Feb. 1993, 26: 62\u201376.","journal-title":"IEEE Computer"},{"issue":"5","key":"BF02948839_CR16","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1109\/TC.1987.1676939","volume":"36","author":"W J Dally","year":"1987","unstructured":"Dally W J, Seitz C L. Deadlock-free message routing in multiprocessor interconnection networks.IEEE Trans. Comput., May 1987, C-36(5): 547\u2013553.","journal-title":"IEEE Trans. Comput."},{"issue":"10","key":"BF02948839_CR17","doi-asserted-by":"crossref","first-page":"1055","DOI":"10.1109\/71.473515","volume":"6","author":"Jose Duato","year":"1995","unstructured":"Jose Duato. A necessary and sufficient condition for deadlock-free adaptive routing in wormhole networks.IEEE Trans. Parallel and Distributed Systems, Oct. 1995, 6(10): 1055\u20131067.","journal-title":"IEEE Trans. Parallel and Distributed Systems"},{"issue":"10","key":"BF02948839_CR18","doi-asserted-by":"crossref","first-page":"1158","DOI":"10.1109\/12.729799","volume":"47","author":"Libeskind-Hadas","year":"1998","unstructured":"Libeskind-Hadas. A tight lower bound on the number of channels required for deadlock-free wormhole routing.IEEE Trans. Computers, Oct. 1998, 47(10): 1158\u20131161.","journal-title":"IEEE Trans. Computers"},{"issue":"2","key":"BF02948839_CR19","doi-asserted-by":"crossref","first-page":"194","DOI":"10.1109\/71.127260","volume":"3","author":"W J Dally","year":"1992","unstructured":"Dally W J. Virtual channel flow control.IEEE Trans. Parallel and Distributed Systems, Mar. 1992, 3(2): 194\u2013205.","journal-title":"IEEE Trans. Parallel and Distributed Systems"}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948839.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02948839\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02948839","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T23:03:10Z","timestamp":1558566190000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02948839"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,11]]},"references-count":19,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2000,11]]}},"alternative-id":["BF02948839"],"URL":"https:\/\/doi.org\/10.1007\/bf02948839","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2000,11]]}}}