Multidimensional fault tolerance in cube-connected cycles architecture

被引:0
|
作者
Huang, J.M. [1 ,2 ,3 ]
Yang, T.C. [1 ,2 ,4 ,5 ,6 ,7 ,8 ,9 ,10 ]
机构
[1] Dept. of Information Engineering, Feng Chia University, 100, Wen-Hwa Rd., Sea-Tween, Taichung 407, Taiwan
[2] Feng Chia University, Taichung, Taiwan
[3] Dept. of Information Engineering, Feng Chia University
[4] National Cheng-Kung University, Taiwan
[5] Illinois Institute of Technology, Chicago, IL, United States
[6] Lockheed Research Laboratory, Palo Alto, CA, United States
[7] Bell Laboratories, Naperville, IL, United States
[8] Motorola, Inc., Schaumburg, IL, United States
[9] FCU
[10] Comp. and Commun. Res. Laboratories, ITRI, Hsinchu, Taiwan
关键词
Computer architecture - Computer simulation - Interconnection networks;
D O I
10.1080/1206212X.2000.11441617
中图分类号
学科分类号
摘要
This paper proposes reliable cube-connected cycles architecture that can tolerate multidimensional faults. In the proposed architecture, multiple bus sets can be inserted to formulate several blocks. The spares are placed at the middle position of block for shortening the interconnection link after reconfiguration. With this architecture, two reconfiguration schemes, both based on the block, are associated. Scheme 1 is for the local reconfiguration, and scheme 2 conducts the partial global reconfiguration after the failure of the trial of scheme 1. Both schemes can reach multidimension fault tolerance capability and prevent the spare substitution domino effect. Reliability analysis indicates that scheme 2 is always better than scheme 1. Simulation results show that both schemes provide for increases in reliability over previous work, especially the RECCC scheme, at the same redundant spare PE ratio. In addition, simulation results suggest that, for a long mission time, a smaller number of bus sets (e.g., 3) involved in the architecture is preferred.
引用
收藏
页码:140 / 150
相关论文
共 50 条
  • [21] An optimal multicast algorithm for cube-connected cycles
    Jianping Song
    Zifeng Hou
    Yuntao Shi
    Journal of Computer Science and Technology, 2000, 15 : 572 - 583
  • [22] Compressing cube-connected cycles and butterfly networks
    Klasing, R
    Luling, R
    Monien, B
    NETWORKS, 1998, 32 (01) : 47 - 65
  • [23] Novel broadcasting schemes on cube-connected cycles
    Fang, JF
    Lee, CM
    Yen, EY
    Chen, RX
    Feng, YC
    2005 IEEE PACIFIC RIM CONFERENCE ON COMMUNICATIONS, COMPUTERS AND SIGNAL PROCESSING (PACRIM), 2005, : 629 - 632
  • [24] Improved compressions of cube-connected cycles networks
    Klasing, R
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1998, 9 (08) : 803 - 812
  • [25] ON CROSSING NUMBERS OF HYPERCUBES AND CUBE-CONNECTED CYCLES
    SYKORA, O
    VRTO, I
    BIT NUMERICAL MATHEMATICS, 1993, 33 (02) : 232 - 237
  • [26] Properties and performance of folded cube-connected cycles
    Sebastian, MP
    Rao, PSN
    Jenkins, L
    JOURNAL OF SYSTEMS ARCHITECTURE, 1998, 44 (05) : 359 - 374
  • [27] Layout of the cube-connected cycles without long wires
    Chen, GH
    Lau, FCM
    COMPUTER JOURNAL, 2001, 44 (05): : 374 - 383
  • [28] OPTIMAL ROUTING ALGORITHM AND THE DIAMETER OF THE CUBE-CONNECTED CYCLES
    MELIKSETIAN, DS
    CHEN, CYR
    IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (10) : 1172 - 1178
  • [29] A parallel algorithm for Lagrange interpolation on the cube-connected cycles
    Sarbazi-Azad, H
    Ould-Khaoua, M
    Mackenzie, LM
    MICROPROCESSORS AND MICROSYSTEMS, 2000, 24 (03) : 135 - 140
  • [30] Page-number of hypercubes and cube-connected cycles
    Konoe, Michiko, 1600, (20):