In this paper, we present a reconfiguration approach to identify the maximal fault-free subcube-ring for tolerating faults in injured hypercubes, The fault-free subcube-ring is connected by a ring of fault-free subcubes with dilation 3. By exploiting the size of fault-free subcubes as large as possible, the maximal fault-free subcube-ring with higher processor utilization is obtained. Using this approach, we can tolerate more than n faults in n-dimensional hypercubes. To demonstrate the fault-tolerant capability of our approach, we implement two fault-tolerant algorithms, matrix-multiplication and sorting algorithms, on the nCUBE/2E hypercube machine with 32 processors. The simulation results show that our reconfiguration approach has low performance slowdown and high processor utilization.
