1993
DOI: 10.1109/24.257825
|View full text |Cite
|
Sign up to set email alerts
|

A generalized algorithm for evaluating distributed-program reliability

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
21
0

Year Published

1995
1995
2014
2014

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 53 publications
(21 citation statements)
references
References 11 publications
0
21
0
Order By: Relevance
“…The time complexity of this evaluation approach is analyzed in Sect. 6. Finally, the conclusions are drawn in Sect.…”
Section: Introductionmentioning
confidence: 97%
See 1 more Smart Citation
“…The time complexity of this evaluation approach is analyzed in Sect. 6. Finally, the conclusions are drawn in Sect.…”
Section: Introductionmentioning
confidence: 97%
“…For real-time performance evaluation, benchmark is often used to explore the real-time system behavior [3,4]. For reliability evaluation, some algorithms are designed to simplify Markov models, generate corresponding File Spanning Tree (FST) for evaluation with the K-terminal reliability factoring theorems or the theories of graph and probability synthetically [5,6,12].…”
Section: Introductionmentioning
confidence: 99%
“…The follow-up research, e.g. Chen and Huang [6], Kumar and Agrawal [19], Chen et al [5], Lin et al [23], and Dai et al [9], continued the study based on the Kumar et al's [20] model. These models had thus inherited the common assumption that the operational probabilities of nodes and links are constant.…”
Section: Introductionmentioning
confidence: 99%
“…The intention of the LV is to avoid loops in the algorithm, which implies that one node is not traversed more than once [5], [6]. The updating of this vector is simple, which means that every node has value from the parent node in the tree and its value is represented with 1.…”
Section: Vthe Distributed System Reliability Of the Intelligence Infmentioning
confidence: 99%