### Citations

30 |
How Robust is the n-Cube
- Becker, Simon
- 1986
(Show Context)
Citation Context ...ed such that S conta,ins a connected component of 2m-1 + 1 or more nonfaulty nodes. Most parallel algorithms can be formulated with the dimension n of the hypercube being a parameter of the algorithm =-=[5]-=-. Since a subcube is a subset of a hypercube which preserves the properties of hypercube, the reconfiguration problem in a faulty hypercube re0-8186-7180-7/95 $04.00 0 1995 IEEE 220 Toshihiko Sasama H... |

13 | A Reconfiguration Algorithm for Fault Tolerance in a Hypercube Multiprocessor - Ozguner, Aykanat - 1988 |

2 |
Raghavendra, “Reconfiguration of binary trees in faulty hypercubes
- Yang, S
- 1993
(Show Context)
Citation Context ... other (n - 1)-cube. They showed that [n/21 faults ca.n be tolerated in the worst case by the modified subcube partitioning technique while maintaining a fault-free (n - 1)-cube. Yang and Raghavendra =-=[2]-=- presented a distributed scheme for the reconfiguration of an embedded binary tree into a hypercube with faults. In this scheme, the faulty node in the selected binary tree is replaced with a nonfault... |

1 |
Fault Tolerant Subcube Allocation
- Chang, Bhuyan
- 1993
(Show Context)
Citation Context ...ds: Hypercube, Fault Tolerance, Allocation, The Maximum Dimemional Fault-Free Subcube 1 Introduction Different but related approaches to hypercube fault-tolerance have been reported. Chang and Bhuyan =-=[l]-=- present,ed a modified subcube partitioning strategy to construct fault-free subcubes in a hypercube with faults. The technique selects a regular (n - 1)-cube and then the faulty node in the selected ... |

1 |
Fault-Tolerant Routing with Regularity Restoration in Boolean n-Cube Interconnection Networks
- Horng, Kleinrock
- 1991
(Show Context)
Citation Context ...ree into a hypercube with faults. In this scheme, the faulty node in the selected binary tree is replaced with a nonfaulty node which is out of the tree and at Hamming Distance 1. Horng and Kleinrock =-=[3]-=- proposed a set of techniques to restore the regularity of a Boolean n-cube network in the presence of node failures. The shortest path between any node pair in the modified fault-free network holds t... |

1 |
et al., “Tolerating Faults in Hypercubes Using Subcube Partitioning
- Bruck
- 1992
(Show Context)
Citation Context ...of a Boolean n-cube network in the presence of node failures. The shortest path between any node pair in the modified fault-free network holds the “shortest” property also in the n-chbe. Bruck et al. =-=[4]-=- studied a technique to obtain tolerant partitions by which partitioned mcube S is guaranteed such that S conta,ins a connected component of 2m-1 + 1 or more nonfaulty nodes. Most parallel algorithms ... |

1 | An Algebraic Technique to Analyze Reconfiguration for Fault Tolerance in a Hypercube - Rai, Trahan - 1991 |

1 |
Embedding Cube-Connected Cycles Graphs into Faulty Hypercubes
- Brruck
- 1994
(Show Context)
Citation Context ...alue F( 2 F) of F . Let Fk and Fk be F and F when n = k, respectively. Fk can be calculated by using FkI(6 > k'). Since IF4/ = 5 is known in an exhaustive method, we get F4 = F4 = F4. J.Bruck, et al. =-=[8]-=- said in Corollary 8 that F4 = 5. For n 2 5, we will calculate Fk without Fk. For the expression~l simplicity, we express one index by one row, and Fk with IFkI = 1 by a matrix with 1 rows and k colum... |