A Fault-Tolerant Modular Architecture for Binary Trees

1 April 1986

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers

Vol. C-35 (4) , 356-361
https://doi.org/10.1109/tc.1986.1676770

Abstract

A new modular, fault-tolerant scheme is proposed for the binary tree architecture. The approach uses redundant modular fault- tolerant building blocks to construct the complete binary tree. The restructuring operation is local to each faulty module. The proposed scheme is shown to be more reliable and easier to implement than the existing fault-tolerant schemes.

Keywords

This publication has 7 references indexed in Scilit:

An Efficient Unsorted VLSI Dictionary Machine
IEEE Transactions on Computers, 1985
A Generalized Dictionary Machine for VLSI
IEEE Transactions on Computers, 1985
Fault Tolerance in Binary Tree Architectures
IEEE Transactions on Computers, 1984
A multiprocessor network suitable for single-chip VLSI implementation
Published by Association for Computing Machinery (ACM) ,1984
The Diogenes Approach to Testable Fault-Tolerant Arrays of Processors
IEEE Transactions on Computers, 1983
A Dictionary Machine (for VLSI)
IEEE Transactions on Computers, 1982
A Graph Model for Fault-Tolerant Computing Systems
IEEE Transactions on Computers, 1976