Improved compressions of cube-connected cycles networks
Ralf Klasing · IEEE Transactions on Parallel and Distributed Systems · 1998
We present a new technique for the embedding of large cube-connected cycles networks (CCC) into smaller ones, a problem that arises when algorithms designed for an architecture of an ideal size are to be executed on an existing architecture of a fixed size. Using the new embedding strategy, we show that the CCC of dimension I can be embedded into the CCC of dimension k with dilation 1 and optimum load for any k, l/spl isin/ N, k/spl ges/8, such 5/3+c/sub k/<1/k/spl les/2, c/sub k/=3.2(2/3k)/4k+3, thus improving known results. Our embedding technique also leads to improved dilation-1 embeddings in the case 3/2<1/k/spl les/5/3+C/sub k/.