Configuration of VLSI Arrays in the Presence of Defects
Journal of the ACM (JACM)
Fault tolerant and fault testable hardware design
Fault tolerant and fault testable hardware design
The cube-connected cycles: a versatile network for parallel computation
Communications of the ACM
Introduction to VLSI Systems
A reconfigurable and fault-tolerant VLSI multiprocessor array
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
STOC '79 Proceedings of the eleventh annual ACM symposium on Theory of computing
Computational Aspects of VLSI
Design of a highly reliable cube-connected cycles architecture
Proceedings of the 1991 ACM/IEEE conference on Supercomputing
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Multiscattering on the cube-connected cycles
Parallel Computing
A Versatile Ring-Connected Hypercube
IEEE Micro
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
A method of trading diameter for reduced degree to construct low cost interconnection networks
Proceedings of the 1999 ACM symposium on Applied computing
Periodically Regular Chordal Rings
IEEE Transactions on Parallel and Distributed Systems
A Cube-Connected Cycles Architecture with High Reliability and Improved Performance
IEEE Transactions on Computers
A Pairwise Substitutional Fault Tolerance Technique for the Cube-Connected Cycles Architecture
IEEE Transactions on Parallel and Distributed Systems
Adding Multiple-Fault Tolerance to Generalized Cube Networks
IEEE Transactions on Parallel and Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
VLSI/WSI Designs for Folded Cube-Connected Cycles Architectures.
VLSID '96 Proceedings of the 9th International Conference on VLSI Design: VLSI in Mobile Communication
Sparse hypercube: a minimal k-line broadcast graph
Discrete Applied Mathematics
| Hi-index | 15.00 |
The cube-connected cycles network is suitable for realization in VLSI, since it satisfies the properties of degree boundedness of the nodes (=3), and regularity of layout. Another network called the cubical ring-connected cycles (CRCC) is proposed that has all the desirable features of the cube-connected cycle (CCC) and is single-cycle fault tolerant as well. The degree of each processor is less than or equal to four, the number of processors increases from 2/sup r+s/ to 2/sup r/(2/sup 2/+1), for integers r and s, and the number of links increases by a factor of one-third over the corresponding CCC. Reliability improvements of the CRCC network over the CCC are studied. A regular layout scheme suitable for VLSI implementation of the CRCC is presented. Reconfiguration techniques under failures of processors in the CRCC are discussed.