Embedding of linear array and binary tree in cubical ring connected cycles networks

The cubical ring connected cycles (CRCC) network, a modified version of cube connected cycles (CCC) network, preserves all the desirable aspects of CCC, such as fixed node connectivity, modularity, ease of layout, and capability of pipelining and parallelism, and can emulate the topology of a CCC even in the case of multiple failures of processors and links. To enhance the capability of dynamic reconfiguration, the authors study the embedding of linear arrays and complete binary trees in CRCC. The expansion and dilation cost of their embedding method is analyzed. A distributed algorithm for binary tree embedding is presented.