摘要： k-元n-立方( )网络被广泛应用于直接互联网络并行处理系统中。当 某些维上的节点数不相同时，该文利用一维环的交叉乘积定义了广义的K-元n-立方( , )网络，提出 网络表面积和体积的计算公式，利用表面积确定最优的广播结构，并分析了2个节点间最短路由数的计算公式和路由选取方法。

关键词: 广义K-元n-立方, 广播树, 最短路由

Abstract: k-ary n-cube( ) interconnect networks are widely used in the parallel processing system. If the numbers of nodes in some dimensions are different, generalized K-ary n-cube interconnect networks ( , )are defined using cross product of 1D ring. Calculation methods of surface and volume are proposed, and the best structure of broadcasting is determined using the surface. Formula of minimal routing path between tow nodes and the method of path selecting are ananlyzed.

Key words: generalized K-ary n-cube, broadcasting tree, minimal routing

中图分类号: 

• TP316.4