Architecting fault-tolerant software systems

Sözer, Hasan

doi:10.3990/1.9789036527880

Cited by 30 publications

(25 citation statements)

References 114 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Figure 7.1 provides an overall view of the concepts in Recoverable Process. For the sake of brevity, [88] assumes that only child processes that have a common parent process can be recovered; this thesis also makes the same assumption. AppProcess represents a child process, and has the attributes id, name, status, init and kill.…”

Section: Recoverable Processmentioning

confidence: 99%

“…Therefore, one may group all the child processes as one recovery unit such that if MPCore is killed, the recovery unit reports a failure. This is known as global recovery [88]. One may also assume that if any of the processes Audio, Video and UserInterface is killed, it can be restarted individually.…”

Section: An Application Of Recoverable Processmentioning

confidence: 99%

“…In this case, it is possible to define separate recovery units for the individual recovery of Audio, Video and UserInterface. This is known as local recovery [88] which aims at improving the availability of non-faulty processes. …”

Section: An Application Of Recoverable Processmentioning

confidence: 99%

“…Examples are [88]: compensation, backward recovery, and forward recovery. Compensation means that the system continues to operate without any loss of function or data in case of a failure.…”

Section: The Specification Layermentioning

confidence: 99%

“…In [88], a runtime enforcement technique called Recoverable Process is published to make processes fault-tolerant. Here, processes are monitored to detect their failures, and a failed process is restarted along with other processes that are semantically related to it.…”

Section: Recoverable Processmentioning

confidence: 99%

See 4 more Smart Citations

Achieving naturalness in runtime enforcement

Abadi¹

View full text Add to dashboard Cite

Section: Recoverable Processmentioning

confidence: 99%

Section: An Application Of Recoverable Processmentioning

confidence: 99%

Section: An Application Of Recoverable Processmentioning

confidence: 99%

Section: The Specification Layermentioning

confidence: 99%

Section: Recoverable Processmentioning

confidence: 99%

See 3 more Smart Citations

Achieving naturalness in runtime enforcement

Abadi¹

View full text Add to dashboard Cite

Event Modules

Malakuti¹,

Akşit

2014

Transactions on Aspect-Oriented Software Development XI

View full text Add to dashboard Cite

Runtime verification (RV) facilitates detecting the failures of software during its execution. Due to the complexity of RV techniques, there is an increasing interest in achieving abstractness, modularity, and compose-ability in their implementations by means of dedicated linguistic mechanisms. This paper defines a design space to evaluate the existing domain-specific languages for implementing RV techniques, and identifies the shortcomings of a representative set of these languages with respect to the design space. This paper advocates the need for a language composition framework, which offers the necessary mechanisms to achieve abstractness, modularity, and compose-ability in the implementation of domain-specific crosscutting concerns such as the concerns of RV techniques. We explain event modules as novel linguistic abstractions for modular implementation of domain-specific crosscutting concerns. This paper discusses the implementation of event modules in the EventReactor language, and illustrates the suitability of event modules to implement RV techniques by means of two complementary examples.

show abstract

Availability analysis of software architecture decomposition alternatives for local recovery

et al. 2016

View full text Add to dashboard Cite

Due to copyright restrictions, the access to the full text of this article is only available via subscription.We present an efficient and easy-to-use methodology to predict—at design time—the availability of systems that support local recovery. Our analysis techniques work at the architectural level, where the software designer simply inputs the software modules’ decomposition annotated with failure and repair rates. From this decomposition, we automatically generate an analytical model (a continuous-time Markov chain), from which an availability measure is then computed, in a completely automated way. A crucial step is the use of intermediate models in the input/output interactive Markov chain formalism, which makes our techniques efficient, mathematically rigorous, and easy to adapt. In particular, we use aggressive minimization techniques to keep the size of the generated state spaces small. We have applied our methodology on a realistic case study, namely the MPlayer open-source software. We have investigated four different decomposition alternatives and compared our analytical results with the measured availability on a running MPlayer. We found that our predicted results closely match the measured ones .Dutch Ministry of Economic Affairs ; the Netherlands Organization for Scientific Research ; European Commissio

show abstract

Architecting fault-tolerant software systems

Abstract: CTIT Ph.D. thesis series no. 09-135.

Cited by 30 publications

References 114 publications

Achieving naturalness in runtime enforcement

Achieving naturalness in runtime enforcement

Event Modules

Availability analysis of software architecture decomposition alternatives for local recovery

Contact Info

Product

Resources

About