Ring-connected hypercubes and their relationship to cubical ring connected cycles and dynamic redundancy networks

Authors:
Isaac Yi-Yuan Lee;Sheng-De Wang
Affiliations:
Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, ROC;Department of Electrical Engineering, National Taiwan University, Taipei, Taiwan 106, ROC
Venue:
CSC '93 Proceedings of the 1993 ACM conference on Computer science
Year:
1993

Citing 8
Cited 2

The Cubical Ring Connected Cycles: A Fault Tolerant Parallel Computation Network

IEEE Transactions on Computers
Design and Analysis of Dynamic Redundancy Networks

IEEE Transactions on Computers
Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)

Interconnection networks for large-scale parallel processing: theory and case studies (2nd ed.)
Designing fault-tolerant systems using automorphisms

Journal of Parallel and Distributed Computing
Introduction to parallel algorithms and architectures: array, trees, hypercubes

Introduction to parallel algorithms and architectures: array, trees, hypercubes
Distributed loop computer networks: a survey

Journal of Parallel and Distributed Computing
Comments on "Line Digraph Iterations and Connectivity Analysis of de Bruijn and Kautz Graphs"

IEEE Transactions on Computers
The cube-connected cycles: a versatile network for parallel computation

Communications of the ACM

A Versatile Ring-Connected Hypercube

IEEE Micro
Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks

IEEE Transactions on Parallel and Distributed Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we first present a 1-fault-tolerant (1-ft) hypercube model with degree 2r, the ring-connected hypercube (RCH), which has the lowest degree among all 1-ft, one spare node, r-dimensional hypercube architecture yet discovered. Then we propose a zero-time reconfiguration algorithm via an add-and-modulo automorphism. Furthermore, by introducing the equivalence from hypercubes to cube-connected cycles (CCC's) and to butterflies (BF's), we find there is also a corresponding equivalence from RCH's to cubical ring connected cycles (CRCC) and to dynamic redundancy networks (DRN's). From this fact, we find out that once a symmetric fault-tolerant structure has been discovered for one of the three models, then it can apply directly to the other hypercubic networks. Applying the technique, we find a degree 6, 1-ft Benes network. Another point is we think that the strong relationship between hypercubes, CCC's and BF's should be paid more attention, and finally from this equivalence relationship to the RCH's we propose three new bounded-degree k-ft models: k-ft CCC's, k-ft BF's, and k-ft Benes networks.