The k-ary n-cube has been the most commonly used interconnection topology for distributed-memory parallel systems. Thispaper considers the cycle embedding problem in k-ary 2-cubes with conditional edge faults and shows that there exists a cycle of everyeven length from 4 to k2 in a k-ary 2-cube with at most 3 edge faults in which each vertex is incident with at least two healthy edges forevenk≥4.%K元n方体已经成为分布式储存并行系统最常用的网络拓扑结构.研究带有条件故障边的K元2方体的圈嵌入问题,证明了在k≥4为偶整数的k元2方体中,若其故障边数不超过3且每个顶点至少与两条非故障边相关联,那么该K元2方体存在长度在4到k2间的任意偶长的无故障圈.
展开▼
