论文部分内容阅读
一种应用于大规模并行处理系统的结点度等于常数的递归多级分层互连网络 ,称为全互连立方体网络 ( FCCN,Fully Connected Cubic Network) .FCCN具有可扩展性好、延伸性能好等优点 .一个 m-FCCN可以由 8个 ( m- 1) - FCCN来递归得到 ,FCCN网络的结点度与网络的规模大小无关 ,网络的直径和平均结点距离都与结点数的立方根成正比 .提出了 FCCN中的简单自寻路算法 .并与最短路由算法进行比较研究 ,计算结果表明 ,在 85%以上的情况下 ,自寻路算法可以得到最短距离 ;并证明了 FCCN在信息局部性系统中具有比较高的并行处理效率
A recursive multi-level hierarchical interconnection network with node degree equal to constant applied to large-scale parallel processing system is called FCCN (Fully Connected Cubic Network) .FCCN has good scalability and extensibility Good, etc. One m-FCCN can be recursively derived from 8 (m-1) - FCCN, the node degree of FCCN network has nothing to do with the size of the network, the diameter of the network and the average node distance are all the same as the cube root of the number of nodes Is proposed.Finally, a simple self-seeking algorithm in FCCN is proposed and compared with the shortest routing algorithm.The results show that the shortest distance can be got by self-seeking algorithm in more than 85% Local system has a higher parallel processing efficiency