 About 13,500 results  books.google.com 1991  No preview Abstract: "Hypercubes and cubeconnected cycles differ in the number of links per node which has fundamental implications on several issues including performance and ease of implementation. 

 books.google.com To overcome the disadvantage of the hypercube, some variations of hypercube
with constant degree such as cubeconnected cycles, butterfly networks, debruijn
networks, shuffle exchange graphs have been proposed [4]. The cubeconnected
... 

 books.google.com 
 books.google.com For the topology of the ideal dbit Chord key space, we simply take the Cayley
graph Rd := G((Z2d ,+),{±2k : k ∈ {0,...,d−1}}). 2.3 Constant Degree Cayley DHTs
Cycloid [4] Cycloid is a constant degree DHT emulating a cube connected cycle
as ... 

 books.google.com 1983  No preview 
 books.google.com north to south, then the kth (1 < k < N) PE on linear array number i (1 < i < N)
would be connected to kth PE on linear array number ... The cubeconnected
cycle (CCC) is a feasible substitute for the hypercube network and has desirable
VLSI ... 

 books.google.com Yamin Li, Tsinghua University Press. HighPerformance Computers and
Interconnection Networks 525 Figure 15.20 Cubeconnected cycles This section
introduces some interconnection networks that have low node degree, or short
diameter, ... 

 books.google.com Each of the new nodes can then handle one of the connections required by the
hypercube node. Such a graph is called a cubeconnected cycle. It is also
important to mention that the cycle must be ordered, i.e., hypercube nodes are ... 

 books.google.com This report presents designs for VLSI circuits computing Cyclic Shifts, Discrete Fourier Transforms, and Integer Multiplication, all based on a machine architecture, the CubeConnectedCycles CCC, introduced by the authors in (10). 

 books.google.com Abstract: "We prove tight bounds for crossing numbers of hypercube and cube connected cycles (CCC) graphs." 

 