Tighter layouts of the cube-connected cycles
Open Access
- 1 January 2000
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 11 (2) , 182-191
- https://doi.org/10.1109/71.841753
Abstract
F.P. Preparata and J. Vuillemin (1981) proposed the cube-connected cycles (CCC) and its compact layout. We give a new layout of the 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 CCC. The area of the new layout deviates from this bound by a small constant factor. If we “unfold” the cycles in the CCC, the resulting structure can be laid out in optimal areaKeywords
This publication has 14 references indexed in Scilit:
- A Tight Layout of the Butterfly NetworkTheory of Computing Systems, 1998
- Optimal layouts of midimew networksIEEE Transactions on Parallel and Distributed Systems, 1996
- THE CUBE-CONNECTED CYCLES NETWORK IS A SUBGRAPH OF THE BUTTERFLY NETWORKParallel Processing Letters, 1992
- Group Action Graphs and Parallel ArchitecturesSIAM Journal on Computing, 1990
- A unified theory of interconnection network structureTheoretical Computer Science, 1986
- Channel routing in knock-knee mode: Simplified algorithms and proofsAlgorithmica, 1986
- An area-maximum edge length trade-off for VSLI layoutInformation and Control, 1985
- A framework for solving VLSI graph layout problemsJournal of Computer and System Sciences, 1984
- The cube-connected cycles: a versatile network for parallel computationCommunications of the ACM, 1981
- Compact Layouts of Banyan/FFT NetworksPublished by Springer Nature ,1981