The Library
Improved compressions of cube-connected cycles networks - (Extended abstract)
Tools
Tools
Tools
UNSPECIFIED (1998) Improved compressions of cube-connected cycles networks - (Extended abstract). In: 24th International Workshop on Graph-Theoretic Concepts in Computer Science, JUN 18-20, 1998, SMOLENICE CASTLE, SLOVAKIA.
Full text not available from this repository.Abstract
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 ii with dilation 1 and optimum load for any k, l is an element of N, k greater than or equal to 8, such that 5/3 + c(k) < l/k less than or equal to 2, c(k) = 4k+3/3.2(2/3k) proving known results. Our embedding technique also leads to improved dilation 1 embeddings in the case 3/2 < l/k less than or equal to 5/3 + c(k).
| Item Type: | Conference Item (UNSPECIFIED) |
|---|---|
| Subjects: | Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software |
| Series Name: | LECTURE NOTES IN COMPUTER SCIENCE |
| Journal or Publication Title: | GRAPH-THEORETIC CONCEPTS IN COMPUTER SCIENCE |
| Publisher: | SPRINGER-VERLAG BERLIN |
| ISBN: | 3-540-65195-0 |
| ISSN: | 0302-9743 |
| Editor: | Hromkovic, J and Sykora, O |
| Date: | 1998 |
| Volume: | 1517 |
| Number of Pages: | 15 |
| Page Range: | pp. 242-256 |
| Publication Status: | Published |
| Title of Event: | 24th International Workshop on Graph-Theoretic Concepts in Computer Science |
| Location of Event: | SMOLENICE CASTLE, SLOVAKIA |
| Date(s) of Event: | JUN 18-20, 1998 |
| URI: | http://wrap.warwick.ac.uk/id/eprint/14079 |
Data sourced from Thomson Reuters' Web of Knowledge
Actions (login required)
 |
View Item |
