An efficient modular spare allocation scheme and its application to fault tolerant binary hypercubes
- Dept. of Computer Science, Univ. of Pittsburgh, Pittsburgh, PA (US)
In this paper, the authors consider fault tolerant systems that are built from modules called fault tolerant basic blocks (FTBB's), where each module contains some primary nodes and some spare nodes. {ital Full spare utilization} is achieved when each spare within an FTBB can replace any other primary or spare node in that FTBB. This, however, may be prohibitively expensive for larger FTBB's. Therefore, the authors show that for a given hardware overhead more reliable systems can be designed using bigger FTBB's without {ital full spare utilization} than using smaller FTBB's with {ital full spare utilization}. {delta} also present sufficient conditions to maximize the reliability of a spare allocation strategy in an FTBB for a given hardware overhead. The proposed spare allocation strategy is applied to two fault tolerant reconfiguration schemes for binary hypercubes. The first scheme uses hardware switches to replace a faulty node and the other scheme uses fault tolerant routing to bypass faulty nodes in the system and deliver messages to the destination node.
- OSTI ID:
- 6253910
- Journal Information:
- IEEE Transactions on Parallel and Distributed Systems (Institute of Electrical and Electronics Engineers); (United States), Journal Name: IEEE Transactions on Parallel and Distributed Systems (Institute of Electrical and Electronics Engineers); (United States) Vol. 2; ISSN ITDSE; ISSN 1045-9219
- Country of Publication:
- United States
- Language:
- English
Similar Records
Adaptive fault-tolerant routing in hypercube multicomputers
Designing and reconfiguring fault-tolerant multiprocessor systems