A proposal for a fault-tolerant binary hypercube architecture
暂无分享,去创建一个
A modular fault-tolerant binary hypercube architecture is proposed that uses redundant processors and is suitable for use in long-life unmaintained applications. Each module initially contains 2/sup i/ (for any >or=0) active processors and k spare processors and is constructed so that each of the spare processors can replace any of the active processors (or any of the other spares) within the module. Thus, the module can tolerate up to k processor faults. This scheme is compared to previously proposed fault-tolerant binary hypercube architectures. It is shown that the scheme can achieve the same level of reliability as other proposed schemes while using significantly fewer spares.<<ETX>>
[1] Robert S. Swarz,et al. The theory and practice of reliable system design , 1982 .
[2] Vinod K. Agarwal,et al. A Reconfiguration Scheme for Yield Enhancement of Large Area Binary Tree Architectures , 1988, IEEE Trans. Computers.
[3] Milos D. Ercegovac,et al. Fault Tolerance in Binary Tree Architectures , 1984, IEEE Transactions on Computers.
[4] Vinod K. Agarwal,et al. A Fault-Tolerant Modular Architecture for Binary Trees , 1986, IEEE Transactions on Computers.