Properties and performance of folded cube-connected cycles

This paper analyzes a new multiprocessor interconnection network - the folded cube-connected cycles (FCCC). This topology is obtained by replacing each node of an n-dimensional folded hypercube by an (n + 1)-cycle. The FCCC, is a regular network of degree 3 and has (n + 1)2(n) nodes. We analyze the topological properties of the FCCC and compare them with those of the cube-connected cycles (CCC). The FCCC has a lower diameter and average distance than that of the CCC. In terms of the most commonly used cost metric (node degree x diameter), the FCCC is better than any of the hypercube-variant networks. It is strongly resilient, and has a fault diameter less than that of the CCC. In terms of bisection width and connectivity also, the FCCC is better than that of the CCC. We propose algorithms for one-to-one communication and broadcasting in FCCC. We also propose an optimal VLSI layout