Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
An area-maximum edge length trade-off for VSLI layout
Information and Control - The MIT Press scientific computation series
A Unified theory of interconnection network structure
Theoretical Computer Science
Processor networks and interconnection networks without long wires
SPAA '89 Proceedings of the first annual ACM symposium on Parallel algorithms and architectures
Group action graphs and parallel architectures
SIAM Journal on Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Optimal Layouts of Midimew Networks
IEEE Transactions on Parallel and Distributed Systems
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Introduction to VLSI Systems
Comments on "A New Family of Cayley Graph Interconnection Networks of Constant Degree Four"
IEEE Transactions on Parallel and Distributed Systems
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
A complexity theory for VLSI
VLSI layout and packaging of butterfly networks
Proceedings of the twelfth annual ACM symposium on Parallel algorithms and architectures
Multilayer VLSI Layout for Interconnection Networks
ICPP '00 Proceedings of the Proceedings of the 2000 International Conference on Parallel Processing
The dragon graph: a new interconnection network for high speed computing
PARA'04 Proceedings of the 7th international conference on Applied Parallel Computing: state of the Art in Scientific Computing
| Hi-index | 0.00 |
Preparata and Vuillemin proposed the cube-connected cycles (${\cal {CCC}}$) and its compact layout in 1981 [17]. We give a new layout of the ${\cal {CCC}}$ which uses less than half the area of the Preparata-Vuillemin layout. We also give a lower bound on the layout area of the ${\cal {CCC}}$. The area of the new layout deviates from this bound by a small constant factor. If we 驴unfold驴 the cycles in the ${\cal {CCC}}$, the resulting structure can be laid out in optimal area.