Fault Tolerance in Binary Tree Architectures
- 1 June 1984
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-33 (6) , 568-572
- https://doi.org/10.1109/TC.1984.1676483
Abstract
Binary tree network architectures are applicable in the design of hierarchical computing systems and in specialized high-performance computers. In this correspondence, the reliability and fault tolerance issues in binary tree architecture with spares are considered. Two different fault-tolerance mechanisms are described and studied, namely: 1) scheme with spares; and 2) scheme with performance degradation. Reliability analysis and estimation of the fault-tolerant binary tree structures are performed using the interactive ARIES 82 program. The discussion is restricted to the topological level, and certain extensions of the schemes are also discussed.Keywords
This publication has 5 references indexed in Scilit:
- A network of microprocessors to execute reduction languages, part IInternational Journal of Parallel Programming, 1979
- Can programming be liberated from the von Neumann style?Communications of the ACM, 1978
- X-TreePublished by Association for Computing Machinery (ACM) ,1978
- Fault-tolerance: The survival attribute of digital systemsProceedings of the IEEE, 1978
- A Graph Model for Fault-Tolerant Computing SystemsIEEE Transactions on Computers, 1976