Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance

DOI10.1109/TC.1987.1676858MaRDI QIDQ3783493zbMATH OpenFDO

Authors Matthew B. Lowrie, W. Kent Fuchs

Publication date 1987

Published in IEEE Transactions on Computers (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TC.1987.1676858

zbMATH Keywords

computer architecturedesign of reconfigurable tree architecturesreliabilityspare processorssubtree oriented fault toleranceVLSI layout

Mathematics Subject Classification ID

Theory of software (68N99) Applications of graph theory to circuits and networks (94C15)

Recommendations

• An augmented \(k\)-ary tree multiprocessor with real-time fault-tolerant capability
• Analysis and design of a fault-tolerant tree architecture
• An easily-diagnosable fault-tolerant binary tree architecture
• A local-sparing design methodology for fault-tolerant multiprocessors
• Minced trees, with applications to fault-tolerant VLSI processor arrays

Cited in

(6)

• An easily-diagnosable fault-tolerant binary tree architecture
• Dependability evaluation of hierarchical systems
• Finding a target subnetwork in sparse networks with random faults
• A local-sparing design methodology for fault-tolerant multiprocessors
• Analysis and design of a fault-tolerant tree architecture
• An augmented \(k\)-ary tree multiprocessor with real-time fault-tolerant capability

This page was built for publication: Reconfigurable Tree Architectures Using Subtree Oriented Fault Tolerance

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3783493)