The cube-connected-cycles: A versatile network for parallel computation
- 1 October 1979
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02725428,p. 140-147
- https://doi.org/10.1109/sfcs.1979.43
Abstract
We introduce a network of processing elements, the cube-connected-cycles (CCC), complying with the present technological constraints of VLSI design. By combining the principles of parallelism and pipelining, the CCC can emulate the cube-connected machine with no significant degradation of performance but with a much more compact structure. We describe in detail how to program the CCC for efficiently solving a large class of problems, which includes Fast-Fourier-Transform, sorting, permutations, and derived algorithms. The CCC can also be used as a general purpose parallel processor.Keywords
This publication has 12 references indexed in Scilit:
- Area-time complexity for VLSIPublished by Association for Computing Machinery (ACM) ,1979
- Bitonic Sort on a Mesh-Connected Parallel ComputerIEEE Transactions on Computers, 1979
- Fast parallel sorting algorithmsCommunications of the ACM, 1978
- New Parallel-Sorting SchemesIEEE Transactions on Computers, 1978
- Some Complexity Results for Matrix Computations on Parallel ProcessorsJournal of the ACM, 1978
- The Indirect Binary n-Cube Microprocessor ArrayIEEE Transactions on Computers, 1977
- Parallelism in Comparison ProblemsSIAM Journal on Computing, 1975
- Cellular arrays for the solution of graph problemsCommunications of the ACM, 1972
- Parallel Processing with the Perfect ShuffleIEEE Transactions on Computers, 1971
- The ILLIAC IV ComputerIEEE Transactions on Computers, 1968