Title :
LN-tree: a fault tolerant tree architecture
Author :
Srinivasan, K.Y. ; Sood, A.K.
Author_Institution :
Dept. of Comput. Sci. & Eng., Toledo Univ., OH, USA
Abstract :
The analysis and design is presented of a highly reliable tree structure, the LN tree. The LN tree is formed by augmenting the simplex binary tree with redundant nodes and links. The reliability of the proposed structure is evaluated and compared with previously proposed augmented tree architectures. The results of the comparison show that the LN tree is more reliable than the existing fault-tolerant tree structures
Keywords :
fault tolerant computing; parallel architectures; trees (mathematics); LN-tree; fault tolerant tree architecture; redundant nodes; simplex binary tree; tree structure; Binary trees; Degradation; Fault tolerance; Redundancy; System performance; Tree data structures; Tree graphs;
Conference_Titel :
Frontiers of Massively Parallel Computation, 1988. Proceedings., 2nd Symposium on the Frontiers of
Conference_Location :
Fairfax, VA
Print_ISBN :
0-8186-5892-4
DOI :
10.1109/FMPC.1988.47493
