摘要:基于交叉立方体环连接的Peterson图互联网络RCP(n)具有优良的特性.在高性能并行计算机系统中,信息通过若干内结点不交叉的路径并行传输,这些路径的长度将直接影响并行计算的性能.本文提出了一种时间复杂度为o(n2)的RCP(n)网络并行路由算法,可输出源点u到目标点v的两条并行路径P0,P1,并证明Pi≤u到v距离+4(i=0,1),说明该算法是通信高效的.
注:因版权方要求,不能公开全文,如需全文,请咨询杂志社
热门期刊服务
Journal of Semiconductors Chinese Journal of Structural Chemistry Research in Astronomy and Astrophysics Journal of Hydrodynamics Frontiers of Information Technology Electronic Engineering International Journal of Computing Journal of Systems Engineering and Electronics Hepatobiliary Pancreatic Diseases International Control Theory and Technology Hepatobiliary Pancreatic Diseases International Chinese Optics Letters International Journal of Automation Computing