Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance
- 1 October 1987
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-36 (10) , 1172-1182
- https://doi.org/10.1109/tc.1987.1676858
Abstract
An approach to the design of reconfigurable tree architectures is presented in which spare processors are allocated at the leaves. The approach is unique in that spares are associated with subtrees and sharing of spares between these subtrees can occur. The Subtree Oriented Fault Tolerance (SOFT) approach is more reliable than previous approaches capable of tolerating link and switch failures for both single-chip and multichip tree implementations while reducing redundancy in terms of both spare processors and links. VLSI layout is O(n) for binary trees and is directly extensible to N-ary trees and fault tolerance through performance degradation.Keywords
This publication has 11 references indexed in Scilit:
- IN-SITU MACHINING AND REPAIR OF CAMERON FC STYLE XMAS TREESPublished by Society of Petroleum Engineers (SPE) ,1989
- A Fault-Tolerant Modular Architecture for Binary TreesIEEE Transactions on Computers, 1986
- A Generalized Dictionary Machine for VLSIIEEE Transactions on Computers, 1985
- Fault Tolerance in Binary Tree ArchitecturesIEEE Transactions on Computers, 1984
- The Diogenes Approach to Testable Fault-Tolerant Arrays of ProcessorsIEEE Transactions on Computers, 1983
- An optimal 2‐FT realization of binary symmetric hierarchical tree systemsNetworks, 1982
- Hypertree: A Multiprocessor Interconnection TopologyIEEE Transactions on Computers, 1981
- X-TreePublished by Association for Computing Machinery (ACM) ,1978
- Pattern Recognition and Image ProcessingIEEE Transactions on Computers, 1976
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976