计算机应用研究2011，Vol.28Issue(7)：2492-2493,2496,3.DOI:10.3969/j.issn.1001-3695.2011.07.025
蜂窝环上的全广播算法
All-to-all broadcasting algorithms on honeycomb tori
摘要
Abstract
This paper addressed all-to-all broadcasting algorithms on honeycomb tori. The design of the first all-to-all broad-casting algorithm was to find a path going through all the nodes, and the main task was to determine some special nodes on the border. The second one used the fact that honeycomb tori was Hamiltonian. Considering a network with n processors,the former had personalized routing strategy at each node and it required a 3n communication time complexity. This communication time could be reduced to n because the computation time was always assumed to be much lower than the communication time. The latter was based on a Hamiltonian cycle and had an n communication time complexity. These all-to-all broadcasting algorithms are the only ones so far exhibited on a honeycomb torus.关键词
并行计算机/互连网络/蜂窝环/全广播Key words
parallel computers/ interconnection networks/ honeycomb tori/ all-to-all broadcasting分类
信息技术与安全科学引用本文复制引用
殷玉玲..蜂窝环上的全广播算法[J].计算机应用研究,2011,28(7):2492-2493,2496,3.基金项目
贺州学院2010年度院级科研立项资助项目(2010ZRKY14) （2010ZRKY14）
