摘要
一种应用于大规模并行处理系统的结点度等于常数的递归多级分层互连网络 ,称为全互连立方体网络 ( FCCN,Fully Connected Cubic Network) .FCCN具有可扩展性好、延伸性能好等优点 .一个 m-FCCN可以由 8个 ( m- 1) - FCCN来递归得到 ,FCCN网络的结点度与网络的规模大小无关 ,网络的直径和平均结点距离都与结点数的立方根成正比 .提出了 FCCN中的简单自寻路算法 .并与最短路由算法进行比较研究 ,计算结果表明 ,在 85%以上的情况下 ,自寻路算法可以得到最短距离 ;并证明了
Fully Connected Cubic Network(FCCN) is a multi\|level hierarchical interconnection network with constant degree for massive parallel processing systems. FCCN has a number of excellent properties, such as high scalability and modularity. An \%m\% level FCCN is constructed by \!fully connecting\' 8 (\%m\%-1)\|FCCNs. The diameter is in the order of the cubic root of the number of nodes. Owing to the highly scalable structure, the routing algorithm proposed for FCCN is very simple to implement, although the self\|routing algorithm is not optimal. We showed that in more than 85% case the minimum distance is obtained. By using the self\|routing algorithm the average internodal distance is also in order of the cubic root of the number of nodes.
出处
《浙江大学学报（工学版）》
EI
CAS
CSCD
北大核心
2001年第3期318-323,共6页
Journal of Zhejiang University：Engineering Science
基金
浙江大学曹光彪科技发展基金资助项目 (4 13C0 130 2 * 2 980 8
关键词
全互连立方体网络(FCCN)
大规模并行处理
分层互联网
递归互联网
Fully Connected Cubic Network(FCCN)
massive parallel processing system
hierarchical interconnection network
recursive interconnection network
