The cube-connected-cycles: A versatile network for parallel computation

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.

[1]  Abraham Waksman,et al.  A Permutation Network , 1968, JACM.

[2]  H. T. Kung,et al.  Direct VLSI Implementation of Combinatorial Algorithms , 1979 .

[3]  C. Thomborson,et al.  A Complexity Theory for VLSI , 1980 .

[4]  Marshall C. Pease,et al.  The Indirect Binary n-Cube Microprocessor Array , 1977, IEEE Transactions on Computers.

[5]  C. Thomborson,et al.  Area-time complexity for VLSI , 1979, STOC.

[6]  Jean Vuillemin,et al.  A combinatorial limit to the computing power of V.L.S.I. circuits , 1980, 21st Annual Symposium on Foundations of Computer Science (sfcs 1980).

[7]  Marshall C. Pease,et al.  An Adaptation of the Fast Fourier Transform for Parallel Processing , 1968, JACM.

[8]  Franco P. Preparata,et al.  New Parallel-Sorting Schemes , 1978, IEEE Transactions on Computers.

[9]  Charles E. Leiserson,et al.  A Layout for the Shuffle-Exchange Network. , 1980 .

[10]  Lynn Conway,et al.  Introduction to VLSI systems , 1978 .

[11]  Richard M. Brown,et al.  The ILLIAC IV Computer , 1968, IEEE Transactions on Computers.

[12]  Leslie G. Valiant,et al.  Parallelism in Comparison Problems , 1975, SIAM J. Comput..

[13]  Sartaj Sahni,et al.  Bitonic Sort on a Mesh-Connected Parallel Computer , 1979, IEEE Transactions on Computers.

[14]  Harold S. Stone,et al.  Parallel Processing with the Perfect Shuffle , 1971, IEEE Transactions on Computers.

[15]  Daniel S. Hirschberg.  Fast parallel sorting algorithms , 1978, CACM.

[16]  Karl N. Levitt,et al.  Cellular arrays for the solution of graph problems , 1972, Commun. ACM.

[17]  H. T. Kung,et al.  The chip complexity of binary arithmetic , 1980, STOC '80.

[18]  Kenneth E. Batcher,et al.  Sorting networks and their applications , 1968, AFIPS Spring Joint Computing Conference.

[19]  W. Morven Gentleman,et al.  Some Complexity Results for Matrix Computations on Parallel Processors , 1978, JACM.

[20]  F. Preparata,et al.  Area-Time Optimal VLSI Networks Based on the Cube-Connected-Cycles. , 1980 .