This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks
September 1995 (vol. 6 no. 9)
pp. 988-996
ASCII Text
x 
 
Isaac Yi-Yuan Lee, Sheng-De Wang, "Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 9, pp. 988-996, September, 1995.
 
 
BibTex
x
 
@article{ 10.1109/71.466635,
author = {Isaac Yi-Yuan Lee and Sheng-De Wang},
title = {Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks},
journal ={IEEE Transactions on Parallel and Distributed Systems},
volume = {6},
number = {9},
issn = {1045-9219},
year = {1995},
pages = {988-996},
doi = {http://doi.ieeecomputersociety.org/10.1109/71.466635},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - JOUR
JO - IEEE Transactions on Parallel and Distributed Systems
TI - Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks
IS - 9
SN - 1045-9219
SP988
EP996
EPD - 988-996
A1 - Isaac Yi-Yuan Lee,
A1 - Sheng-De Wang,
PY - 1995
KW - Butterfly
KW - circulant graph
KW - cube-connected cycle
KW - graph automorphism
KW - hypercubic networks
KW - interconnection network
KW - multiple-fault tolerant
KW - ring-connected network.
VL - 6
JA - IEEE Transactions on Parallel and Distributed Systems
ER -
 

Abstract—In this paper, we first reviewed a 1-fault-tolerant (1-ft) hypercube model with degree 2r, the ring-connected network (RCN), which has the lowest degree among all 1-ft, one spare node, r-dimensional hypercube architecture yet discovered. Then we proposed a constant-time reconfiguration algorithm via an add-and-modulo automorphism. Furthermore, by introducing the equivalence from hypercubes to cube-connected cycles (CCCs) and to butterflies (BFs), we find there is also a corresponding equivalence from RCNs to cubical ring connected cycles (CRCCs) and to dynamic redundancy networks (DRNs). 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, CCCs and BFs should be paid more attention, and finally from this equivalence relationship we propose three new bounded-degree k-ft models: k-ft CCCs, k-ft BFs, and k-ft Benes networks.

[1] V. Balamanian and P. Banerjee,“A fault-tolerant massively parallel processing architecture,” J. Parallel Distributed Computing, pp. 363-383, Aug. 1987.
[2] P. Banerjee,“The cubical ring connected cycles: A fault-tolerant parallel computationnetwork,” IEEE Trans. Computers, vol. 37, no. 5, pp. 632-636, May 1988.
[3] N. Biggs,Finite Groups of Automorphisms.Cambridge: Cambridge Univ. Press, 1971.
[4] F.T. Boesch and R. Tindell,“Circulants andtheir connectivity,” J. Graph Theory, vol. 8, pp. 487-499, 1984.
[5] J. Bruck,R. Cypher,, and C.-T. Ho,“On the construction of fault-tolerant cube-connected cyclesnetworks,” IBM Research Report, RJ 8079, Apr. 1991.
[6] J. Bruck,R. Cypher,, and C.-T. Ho,“Efficient fault-tolerant meshes and hypercube architectures,” IBM Research Report, RJ 8566, Jan. 1992.
[7] F.R.K. Chung,F.T. Leighton,, and A.L. Rosenberg,“Diogenes: A methodology for designing fault-tolerant VLSI processorarrays,” Proc. 13th Int’l Symp. Fault-Tolerant Computing, pp. 26-31, June 1983.
[8] S. Dutt and J.P. Hayes, “Designing Fault-Tolerant Systems Using Auto-morphisms,” J. Parallel and Distributed Computing, vol. 12, no. 3, pp. 249–268, 1991.
[9] D.-Z. Du,Y.-D. Lyuu,, and D.F. Hsu,“Line digraph iterations and connectivity analysis of de Bruijn and Kautzgraph,” IEEE Trans. Computers, vol. 42, no. 5, pp. 612-616, May 1993.
[10] J.P. Hayes,“A graph model for fault tolerant computing system,” IEEE Trans. Computers, vol. 25, no. 9, pp. 875-884, Sept. 1976.
[11] M. Jeng and H.J. Siegel,“Design and analysis of dynamic redundancy networks,” IEEE Trans. Computers, vol. 37, no. 5, pp. 1,019-1,029, Sept. 1988.
[12] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[13] I.Y.-Y. Lee and S.-D. Wang,“Ring-connected hypercubes and their relationship to cubical ring connected cycles and dynamic redundancynetworks,” Proc. 21st ACM Ann. Computer Science Conf.,Indianapolis, pp. 137-142, Feb.16-18, 1993.
[14] I.Y.-Y. Lee and S.-D. Wang,“Several containment results of the ring-connected hypercubes,” Technical Report NTUEE-94-001, Dept. of Electrical Eng., National Taiwan Univ., Taipei, Taiwan, May30, 1994.
[15] I.Y.-Y. Lee and S.-D. Wang,“A versatile ring-connected hypercube,” IEEE Micro, vol. 14, no. 3, pp. 60-67, June 1994.
[16] F.P. Preparata and J. Vuillemin, “The Cube-Connected Cycles: A Versatile Network for Parallel Computation,” Comm ACM, vol. 24, no. 5, pp. 300-309, 1981.
[17] D.A. Rennels,“On implementing fault-tolerance in binary hypercubes,” Proc. 16th Int’l Symp. Fault-Tolerant Computing, pp. 344-349, June 1986.
[18] H.J. Siegel, Interconnection Networks for Large-Scale Parallel Processing, Second Ed., McGraw-Hill, New York, 1990.

Index Terms:
Butterfly, circulant graph, cube-connected cycle, graph automorphism, hypercubic networks, interconnection network, multiple-fault tolerant, ring-connected network.
Citation:
Isaac Yi-Yuan Lee, Sheng-De Wang, "Ring-Connected Networks and Their Relationship to Cubical Ring Connected Cycles and Dynamic Redundancy Networks," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 9, pp. 988-996, Sept. 1995, doi:10.1109/71.466635
Usage of this product signifies your acceptance of the Terms of Use.