Performance and Reliability Analysis of Computer Systems

Sahner, Robin; Trivedi, Kishor S.; Puliafito, Antonio

doi:10.1007/978-1-4615-2367-3

Cited by 279 publications

(84 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…This section presents first analytic evaluation results of the FANTOMAS approach based on a Markov model [21]. For the model, the system behavior is abstracted as follows:…”

Section: Analytic Evaluationmentioning

confidence: 99%

FANTOMAS Fault Tolerance for Mobile Agents in Clusters

Pals

Petri

Grewe

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. To achieve an efficient utilization of cluster systems, a proper programming and operating environment is required. In this context, mobile agents are of growing interest as base for distributed and parallel applications. As mobile and autonomous software units, mobile agents can execute tasks given to the system and allocate independently all the needed resources. However, with growing cluster sizes, the probability of a failure of one or more system components and therewith the loss of mobile agents rises. While fault tolerance issues for applications based on "traditional" processes have been extensively studied, current agent environments provide only insufficient, if at all, extensions for a capable reaction on such kinds of failures. We examine fault tolerance with regard to properties and requirements of mobile agents, and find that independent checkpointing with receiver based message logging is appropriate in this context. We derive the FANTOMAS (Fault-Tolerant approach for Mobile Agents) design which offers a user transparent fault tolerance that can be activated on request, according to the needs of the task. A theoretical analysis examines the advantages and drawbacks of FANTOMAS.

show abstract

“…This section presents first analytic evaluation results of the FANTOMAS approach based on a Markov model [21]. For the model, the system behavior is abstracted as follows:…”

Section: Analytic Evaluationmentioning

confidence: 99%

FANTOMAS Fault Tolerance for Mobile Agents in Clusters

Pals

Petri

Grewe

2000

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The Fault Tree (FT) 1 [1] is a widespread model in the Reliability field and can be analyzed by generating the Binary Decision Diagram (BDD) [2] representing the same Boolean formula incorporated by the FT. Then, the unreliability (and other results) can be efficiently computed on the BDD [2]. However, the FT modeling power is rather limited: Basic Events (BE) are assumed to be binary and independent, while the combinations of BEs leading to the Top Event (TE), can only be expressed by means of Boolean gates.…”

Section: Introductionmentioning

confidence: 99%

“…So, the particular features of a FT extension are not available in the other extensions. For this 1 The list of all the acronyms mentioned in this paper is available in Tab. 1 reason, in this paper, we integrate the modeling primitives present in three relevant FT extensions (Sec.…”

Section: Introductionmentioning

confidence: 99%

“…For this 1 The list of all the acronyms mentioned in this paper is available in Tab. 1 reason, in this paper, we integrate the modeling primitives present in three relevant FT extensions (Sec. 2), into a single formalism called Generalized Fault Tree (GFT) (Sec.…”

Section: Introductionmentioning

confidence: 99%

“…In particular, the analysis of modules in isolation is performed by resorting to the parametric version of Stochastic Petri Nets [1] and BDDs.…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

Integrating several formalisms in order to increase Fault Trees' modeling power

Codetta‐Raiteri

2011

Reliability Engineering & System Safety

View full text Add to dashboard Cite

The Fault Tree (FT) is a widespread model in the field of Reliability, but its modeling power is very limited. Therefore several FT extensions have been proposed in the literature, each introducing particular modeling primitives, but in a separate way. In this paper, we integrate the primitives coming from three relevant FT extensions (Parametric, Dynamic, and Repairable FT), into the formalism called Generalized FT (GFT). We define each primitive in such a way that it can be combined with any other one. This allows to compactly represent redundancies and symmetries of the system structure, set several kinds of dependency among the events, and model repair processes, in the same model. The paper provides also an analysis process for GFT models based on the modular approach. In particular, we provide the conditions to detect modules, considering the presence of all the primitives. Besides modules, we exploit the parametric form also at the solution level, with the aim of reducing the cost of analysis.

show abstract