Article

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

Authors:

Franco P. Preparata,

Jean VuilleminAuthors Info & Claims

SFCS '79: Proceedings of the 20th Annual Symposium on Foundations of Computer Science

Pages 140 - 147

https://doi.org/10.1109/SFCS.1979.43

Published: 29 October 1979 Publication History

Publisher Site

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.

Cited By

View all

Chang NCheng EHsieh S(2015)Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC ModelACM Transactions on Design Automation of Electronic Systems10.1145/269985420:2(1-16)Online publication date: 2-Mar-2015
https://dl.acm.org/doi/10.1145/2699854
Sibai F(1999)Optimal Clustering of Hierarchical Hyper-Ring MulticomputersThe Journal of Supercomputing10.1023/A:100819921403414:1(53-76)Online publication date: 1-Jul-1999
https://dl.acm.org/doi/10.1023/A%3A1008199214034
Pritchard DNicole D(1993)Cube Connected Mobius LaddersIEEE Transactions on Parallel and Distributed Systems10.1109/71.2056584:1(111-117)Online publication date: 1-Jan-1993
https://dl.acm.org/doi/10.1109/71.205658
Show More Cited By

The cube-connected-cycles: A versatile network for parallel computation
1. Theory of computation
  1. Models of computation
    1. Concurrency

Recommendations

The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems

The hypercube structure is a very widely used interconnection topology because of its appealing topological properties. For massively parallel systems with thousands of processors, the hypercube suffers from a high node fanout which makes such systems ...
A Cube-Connected Cycles Architecture with High Reliability and Improved Performance

The cube-connected cycles (CCC) architecture is an attractive parallel computation network, because it is suitable for VLSI implementation while preserving all the desired features of hypercubes. However, the CCC tends to suffer from considerable ...
Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching
Special issue on parallel bioinspired algorithms

In this paper, we consider the problem of one-to-all broadcast (OAB) in an interconnection network with the topology of the n-dimensional cube-connected cycles, CCC_n, under the following conditions. Routers use distance insensitive switching, e.g., ...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

SFCS '79: Proceedings of the 20th Annual Symposium on Foundations of Computer Science

October 1979

431 pages

Publisher

IEEE Computer Society

United States

Publication History

Published: 29 October 1979

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

28
Total Citations
View Citations
0
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 14 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Chang NCheng EHsieh S(2015)Conditional Diagnosability of Cayley Graphs Generated by Transposition Trees under the PMC ModelACM Transactions on Design Automation of Electronic Systems10.1145/269985420:2(1-16)Online publication date: 2-Mar-2015
https://dl.acm.org/doi/10.1145/2699854
Sibai F(1999)Optimal Clustering of Hierarchical Hyper-Ring MulticomputersThe Journal of Supercomputing10.1023/A:100819921403414:1(53-76)Online publication date: 1-Jul-1999
https://dl.acm.org/doi/10.1023/A%3A1008199214034
Pritchard DNicole D(1993)Cube Connected Mobius LaddersIEEE Transactions on Parallel and Distributed Systems10.1109/71.2056584:1(111-117)Online publication date: 1-Jan-1993
https://dl.acm.org/doi/10.1109/71.205658
Pritchard D(1992)Load balanced deadlock-free deterministic routing of arbitrary networksProceedings of the 1992 ACM annual conference on Communications10.1145/131214.131243(225-234)Online publication date: 1-Apr-1992
https://dl.acm.org/doi/10.1145/131214.131243
Sengupta AJoshi PBandyopadhyay S(1991)A Synthesis Approach to Design Optimally Fault Tolerant Network ArchitectureIEEE Transactions on Computers10.1109/12.6732440:1(94-100)Online publication date: 1-Jan-1991
https://dl.acm.org/doi/10.1109/12.67324
Youssef ANarahari B(1990)The Banyan-Hypercube NetworksIEEE Transactions on Parallel and Distributed Systems10.1109/71.801441:2(160-169)Online publication date: 1-Apr-1990
https://dl.acm.org/doi/10.1109/71.80144
Fang ZLi XNi L(1989)On the Communication Complexity of Generalized 2-D Convolution on Array ProcessorsIEEE Transactions on Computers10.1109/12.1649538:2(184-194)Online publication date: 1-Feb-1989
https://dl.acm.org/doi/10.1109/12.16495
McBurney DSleep M(1988)Transputers + virtual tree kernel = real speedupsProceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 110.1145/62297.62314(128-137)Online publication date: 1-Jan-1988
https://dl.acm.org/doi/10.1145/62297.62314
Jou JAbraham J(1988)Fault-Tolerant FFT NetworksIEEE Transactions on Computers10.1109/12.460637:5(548-561)Online publication date: 1-May-1988
https://dl.acm.org/doi/10.1109/12.4606
Akers SKrishnamurthy B(1987)On group graphs and their fault toleranceIEEE Transactions on Computers10.1109/TC.1987.167698336:7(885-888)Online publication date: 1-Jul-1987
https://dl.acm.org/doi/10.1109/TC.1987.1676983
Show More Cited By

Abstract

Cited By

Recommendations

The Extended Cube Connected Cycles: An Efficient Interconnection for Massively Parallel Systems

A Cube-Connected Cycles Architecture with High Reliability and Improved Performance

Broadcasting in all-output-port cube-connected cycles with distance-insensitive switching

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations