The paper introduces the cube-connected cycles (CCC) as a versatile interconnection pattern for parallel computation. The CCC is designed to comply with technological constraints in VLSI design and can be used for a wide range of problems, including Fast Fourier Transform, sorting, and permutations. The CCC combines pipelining and parallelism, reducing the number of connections per processor to three and achieving efficient performance without significant degradation. The paper details how to program the CCC for solving various problems and discusses its optimal VLSI layout, which is more compact and regular compared to other interconnection patterns like the shuffle-exchange network. The CCC is shown to be optimal in terms of area-time complexity for several applications, making it a promising candidate for hardware implementation of parallel algorithms.The paper introduces the cube-connected cycles (CCC) as a versatile interconnection pattern for parallel computation. The CCC is designed to comply with technological constraints in VLSI design and can be used for a wide range of problems, including Fast Fourier Transform, sorting, and permutations. The CCC combines pipelining and parallelism, reducing the number of connections per processor to three and achieving efficient performance without significant degradation. The paper details how to program the CCC for solving various problems and discusses its optimal VLSI layout, which is more compact and regular compared to other interconnection patterns like the shuffle-exchange network. The CCC is shown to be optimal in terms of area-time complexity for several applications, making it a promising candidate for hardware implementation of parallel algorithms.