The cube-connected cycles: a versatile network for parallel computation
- 1 May 1981
- journal article
- Published by Association for Computing Machinery (ACM) in Communications of the ACM
- Vol. 24 (5) , 300-309
- https://doi.org/10.1145/358645.358660
Abstract
An interconnection pattern of processing elements, the cube-connected cycles (CCC), is introduced which can be used as a general purpose parallel processor. Because its design complies with present technological constraints, the CCC can also be used in the layout of many specialized large scale integrated circuits (VLSI). By combining the principles of parallelism and pipelining, the CCC can emulate the cube-connected machine and the shuffle-exchange network with no significant degradation of performance but with a more compact structure. We describe in detail how to program the CCC for efficiently solving a large class of problems that include Fast Fourier transform, sorting, permutations, and derived algorithms.Keywords
This publication has 15 references indexed in Scilit:
- The chip complexity of binary arithmeticPublished by Association for Computing Machinery (ACM) ,1980
- 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
- Cellular arrays for the solution of graph problemsCommunications of the ACM, 1972
- The ILLIAC IV ComputerIEEE Transactions on Computers, 1968
- An Adaptation of the Fast Fourier Transform for Parallel ProcessingJournal of the ACM, 1968
- Sorting networks and their applicationsPublished by Association for Computing Machinery (ACM) ,1968