Definition and Analysis of Hardware-and-Software Fault-Tolerant Architectures

Quality Analysis of Dependable Systems: A Developer Oriented Approach

“…More specifically, a redundancy schema is a configuration of redundant architectural elements, which behave as a single fault tolerant unit. According to [20], a redundant schema is characterized by the kind of mechanism used to detect errors, the way the constituent elements execute towards serving incoming requests, the confidence that can be placed on the results of the error detection mechanism and the number of component and node faults that can be tolerated. The properties characterizing a redundancy schema are summarized in Table 4.…”

An adaptive approach to achieving hardware and software fault tolerance in a distributed computing environment

“…However, the need for developing a unified method for tolerating both hardware and software faults has been recognised in the last few years, and several proposals in this direction have already appeared in the literature ( [8] [9][10] [14][22] [24]). The idea of implementing fault tolerance separately at the hardware and software layers of a computing system could result in a too weak approach.…”

“…Since realistic examples of implementing software fault tolerance are most based on two or three software variants [14], these instances have a more practical implication than other possible variations.…”

“…There are only a few papers that have considered a combined analysis of fault-tolerant software and hardware [7][13]. Laprie et al [14] conducted a dependability analysis of hardware and software fault-tolerant architectures adopting a Markov approach. Three special architectures that tolerate a single hardware or software fault were examined in detail.…”

Value-driven resource assignment in object-oriented real-time dependable systems

“…Many approaches and methodologies have been defined for accomplishing this task, i.e. to give a quantitative evaluation of the dependability of hardware and software structures, some recent references are [1,3,7,15]. In any case, for our purpose it is sufficient to state that these probabilities can be computed and for each functionality S i , i = 1, 2,..., n we denote with p c,i , p e,i and p n,i the probabilities of delivering a correct, an incorrect or no outcome at the end of an execution, respectively.…”