交叉立方体全端口虫洞路由广播算法  

Broadcast Algorithm in All-port Wormhole-routed Crossed Cubes

作　　者：喻昕[1,2] 吴敏[2] 王国军[2] 

机构地区：[1]广西大学计算机与电子信息学院,南宁530004 [2]中南大学信息科学与工程学院,长沙410083

出　　处：《系统仿真学报》2008年第23期6406-6408,6431,共4页Journal of System Simulation

基　　金：国家杰出青年科学基金项目(60425310);广西高校人才小高地建设创新团队资助计划(桂教人[2007]71号);广西大学科研基金资助项目(X081017)

摘　　要：交叉立方体(crossed cube)是超立方体(hypercube)的一种变型,其某些性质优于超立方体,比如其直径几乎是超立方体的一半。广播通信是并行计算机系统最基本的通信方式。在全端口虫洞模型下,利用递归将交叉立方体分解为互不相交的子交叉立方体的方法,提出了交叉立方体的广播路由算法。其所需时间步为o(n/log2(n+1)),在常数因子范围内是最优的。仿真实验结果进一步说明了算法具有很好的通信性能。The crossed cube proposed by Efe is a variation of hypercube, but some properties of the former are superior to those of the latter. For example, the diameter of the crossed cube is approximately half that of the hypercube. Broadcast is a fundamental communication in parallel computing system. A broadcast algorithm of o （n/log2（n＋1）） rounds in all-port wormlaole-routed crossed cubes was proposed, which recursively decomposed a crossed cube into several disjoint sub-cubes. The algorithm is asymptotically optimal, and the experimental results show its excellent performance.

关 键 词：交叉立方体 超立方体 广播算法 虫洞路由 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]