Title :
A tight layout of the cube-connected cycles
Author :
Chen, Guihai ; Lau, Francis C M
Author_Institution :
Dept. of Comput. Sci., Hong Kong Univ., Hong Kong
Abstract :
F.P. Preparata and J. Vuillemin (1981) proposed the cube connected cycles (CCC) and in the same paper, gave an asymptotically optimal layout scheme for the CCC. We give a new layout scheme for the CCC which requires less than half of the area of the Preparata-Vuillemin layout. We also give a non trivial lower bound on the layout area of the CCC. There is a constant factor of 2 between the new layout and the lower bound. We conjecture that the new layout is optimal (minimal)
Keywords :
VLSI; multiprocessor interconnection networks; parallel architectures; CCC; VLSI; asymptotically optimal layout scheme; cube connected cycles; interconnection network; layout area; layout scheme; non trivial lower bound; parallel algorithms; parallel computers; tight layout; Computer networks; Computer science; Concurrent computing; Embedded computing; Hypercubes; Mathematical model; Multiprocessor interconnection networks; Routing; Very large scale integration; Wires;
Conference_Titel :
High-Performance Computing, 1997. Proceedings. Fourth International Conference on
Conference_Location :
Bangalore
Print_ISBN :
0-8186-8067-9
DOI :
10.1109/HIPC.1997.634524
