Back to Search
Start Over
Fault-tolerant computing on trees
- Source :
- SPDP
- Publication Year :
- 2002
- Publisher :
- IEEE Comput. Soc. Press, 2002.
-
Abstract
- The paper analyzes the fault-tolerance of complete binary tree networks. It shows how an N-mode tree subject to random failures can simulate a perfect, fault-free tree under different fault models. If edges fail with independent probability p >
- Subjects :
- Fractal tree index
Tree rotation
Red–black tree
Incremental decision tree
Theoretical computer science
Binary tree
AVL tree
K-ary tree
Computer science
Optimal binary search tree
Segment tree
Parallel algorithm
Exponential tree
Interval tree
Search tree
Random binary tree
Range tree
Treap
Computer Science::Hardware Architecture
Tree traversal
Tree structure
Computer Science::Operating Systems
Computer Science::Distributed, Parallel, and Cluster Computing
Order statistic tree
Left-child right-sibling binary tree
Subjects
Details
- Database :
- OpenAIRE
- Journal :
- Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing 1990
- Accession number :
- edsair.doi...........b05480001a745bb21e7ef791b5d2d660
- Full Text :
- https://doi.org/10.1109/spdp.1990.143631