1997
DOI: 10.1016/s0898-1221(97)00210-1
|View full text |Cite
|
Sign up to set email alerts
|

A heuristic approach to generating file spanning trees for reliability analysis of distributed computing systems

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
14
0

Year Published

2007
2007
2014
2014

Publication Types

Select...
5
2

Relationship

0
7

Authors

Journals

citations
Cited by 34 publications
(14 citation statements)
references
References 11 publications
0
14
0
Order By: Relevance
“…5, we will find two situations: (1) in each scenario, the fastest response time of P increases with the growth of the reliability-constrains factor λ; (2) in different scenario, though the reliability-constrains factor λ of P is equal, the fastest response time of P may not be equal each other. According to the results of Fig.…”
Section: Results Analysismentioning
confidence: 97%
See 1 more Smart Citation
“…5, we will find two situations: (1) in each scenario, the fastest response time of P increases with the growth of the reliability-constrains factor λ; (2) in different scenario, though the reliability-constrains factor λ of P is equal, the fastest response time of P may not be equal each other. According to the results of Fig.…”
Section: Results Analysismentioning
confidence: 97%
“…General factoring and reduction methods are developed for the distributed program reliability problem [2,10,13,14]. The algorithms SM and FM for computing the reliability of distributed program have been discussed in [1,7,8,11]. …”
Section: Related Workmentioning
confidence: 99%
“…There are some researches on grid service reliability modeling (Kumar et al, 1986;Chen and Huang, 1992;Chen et al, 1997;Lin et al, 2001;Dai and Levitin, 2006a;Dai et al, 2007;Levitin et al, 2006;Levitin and Dai, 2007). In order to model the reliability, different assumptions about the failure distribution, failure types and grid structure are considered.…”
Section: Related Workmentioning
confidence: 99%
“…Most traditional reliability models (Kumar et al, 1986;Chen and Huang, 1992;Chen et al, 1997;Lin et al, 2001) assume the probability of computational resources and their links to be either in failure or operational state approximately constant. However, in grid environments, due to the massive data transmission and large volume of computations, this assumption is not true.…”
Section: Related Workmentioning
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%