Improved compressions of cube-connected cycles networks
Klasing, Ralf. (1998) Improved compressions of cube-connected cycles networks. IEEE Transactions on Parallel and Distributed Systems, Volume 9 (Number 8). pp. 803-812. ISSN 1045-9219Full text not available from this repository.
Official URL: http://dx.doi.org/10.1109/71.706051
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, I is an element of N, k greater than or equal to 8, such 5/3 + c(k) < 1/k less than or equal to 2, c(k) = 4k+3/3.2(2/3k), thus improving known results. Our embedding technique also leads to improved dilation-1 embeddings in the case 3/2 < 1/k less than or equal to 5/3 + c(k).
|Item Type:||Journal Article|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software
T Technology > TK Electrical engineering. Electronics Nuclear engineering
|Divisions:||Faculty of Science > Computer Science|
|Journal or Publication Title:||IEEE Transactions on Parallel and Distributed Systems|
|Official Date:||August 1998|
|Number of Pages:||10|
|Page Range:||pp. 803-812|
|Access rights to Published version:||Restricted or Subscription Access|
Actions (login required)