Premium
An optimal 2‐FT realization of binary symmetric hierarchical tree systems
Author(s) -
Kwan C. L.,
Toida S.
Publication year - 1982
Publication title -
networks
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.977
H-Index - 64
eISSN - 1097-0037
pISSN - 0028-3045
DOI - 10.1002/net.3230120303
Subject(s) - binary tree , fault tolerance , computer science , binary number , realization (probability) , fault tree analysis , graph , tree (set theory) , theoretical computer science , algorithm , mathematical optimization , mathematics , distributed computing , combinatorics , arithmetic , engineering , statistics , reliability engineering
Fault tolerance is expected to become the major concern for complex systems consisting of many computing or processing units. Given a basic nonredundant system of computing units, the problems are to determine the minimum extra units and connections required and their structures so that the resulting system would tolerate k faulty units. These problems have been formulated and solved for some special types of systems by Hayes using a graph model. In this paper, we present a procedure for designing an optimal 2‐FT (two‐fault‐tolerant) structure for binary symmetric hierarchical tree systems.