Efficient algorithms for reliability analysis of distributed computing systems

Lin, Min-Sheng; Chang, Ming-Sang; Chen, Deng-Jyi

doi:10.1016/s0020-0255(99)00003-1

Cited by 36 publications

(10 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…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%

See 1 more Smart Citation

Aeneas: real-time performance evaluation approach for distributed programs with reliability-constrains

Jin

Han

et al. 2007

Cluster Comput

View full text Add to dashboard Cite

A novel approach, called Aeneas, which is based on the execution state of distributed programs, is proposed in this paper. It is for the real-time performance analysis of distributed programs with reliability-constrains. In Aeneas, there are two important factors, the available data files and the transmission paths of each available data file. Some algorithms are designed to find all the transmission paths of each data file needed while the program executes, count the transmission time for each transmission path, then get the aggregate expression of transmission time, calculate the fastest response time and the slowest response time of distributed programs with reliability-constrains. In order to justify the feasibility and the availability of this approach, a series of experiments have been done. The results show that it is feasible and efficient to evaluate the real-time performance for distributed software with reliability-constrains.

show abstract

Section: Related Workmentioning

confidence: 99%

“…(8), (9), (10), (11) and (13), we may get all the results of inequality (7) by employing the above method and the exhausting enumeration algorithms. Suppose A i (i = 1, 2, .…”

Section: (9)mentioning

confidence: 99%

Aeneas: real-time performance evaluation approach for distributed programs with reliability-constrains

Jin

Han

et al. 2007

Cluster Comput

View full text Add to dashboard Cite

show abstract

“…Service reliability, which measures the capability of a system to accomplish its tasks on time, is a very important metric of DC system service quality [9]. Many research works have been devoted to modeling and analysis of the reliability (including service reliability) of DC systems [9][10][11][12][13]. However, most of the previous research works have focused on the failures caused by the 'unintentional' defects embedded in the DC hardware infrastructure and the installed software.…”

Section: Introductionmentioning

confidence: 99%

Service reliability modeling of distributed computing systems with virus epidemics

Peng

2015

Applied Mathematical Modelling

View full text Add to dashboard Cite

International audienceDistributed computing (DC) system is widely implemented due to its low setup cost and high computational capability. However, it might be vulnerable to malicious attacks like computer virus due to its network structure. The service reliability, defined as the probability of fulfilling a task before a specified time, is an important metric of the quality of DC system. This paper attempts to model and compute the service reliability for the DC system under virus epidemics. Firstly, the DC system architecture is modeled by an undirected graph whose nodes (i.e. computers) have a continuous-state model representing its computational capability. Then a set of epidemic differential equations are formulated and solved to obtain the state dynamics of each node under the virus epidemics. A universal generating function (UGF) based approach is proposed to calculate the service reliability of DC system. Numerical results show the effectiveness of the proposed method. The sensitivity analysis on the model parameters, the comparison with centralized computing system and the optimization of defense level parameter are also conducted

show abstract

“…One fundamental consideration in the design of networks is reliability [7,16,20,26,28]. An edge cut (vertex cut) of a connected graph G is a set of edges (vertices) whose removal disconnects G. The edge connectivity kðGÞ of G is the minimum cardinality of an edge cut S of G and if G is noncomplete, then the connectivity jðGÞ of G is the minimum cardinality of a vertex cut S of G. If G is a complete graph of order nðGÞ, then jðGÞ ¼ nðGÞ À 1.…”

Section: Introduction and Terminologymentioning

confidence: 99%