Introduction and Overview

Powell, David; Amendola, Arturo; Arlat, Jean; Attermeyer, Berthold; Beus-Dukic, Ljerka; Bondavalli, Andrea; Coppola, Paolo; Dambra, Carlo; Fantechi, Alessandro; Jenn, Éric; Rabéjac, Christophe; Thevenot, Vincent; Wellings, Andy

doi:10.1007/978-1-4757-3353-2_1

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Moreover, as indicated in [9], "the scope for the implementation of standby redundancy is limited". For these two reasons, active replication is the preferred approach to implement fault-tolerant real-time systems [IO,111. In these systems, failures are masked by processing replicas of an application in a sufficiently large group of processors whose components fail independently. Replicas execute a total ordering protocol, which guarantees that input requests issued by clients will be processed by all functioning replicas in the same order; assuming that the behavior of a replica is deterministic, all functioning replicas undergo the same state transitions and issue identical replies to any given request.…”

Section: Introductionmentioning

confidence: 99%

Avoiding priority inversion on the processing of requests by active replicated servers

Wang

Brasileiro²,

Anceaume³

et al.

Proceedings International Conference on Dependable Systems and Networks

View full text Add to dashboard Cite

We consider the priorit). inversion problem in an actively replicated system. Priority inversion was originally dejined in the context of non-replicated systems. Therefore we first introduce the concept of group priority inversion, which extends the concept of (local) priority inversion to the context of a group of processors that perform an actively replicated processing. We then present the properties of a request scheduling protocol to enforce a total ordering for the processing of requests while avoiding group priority inversions. These properties have been implemented in a protocol that relies on a timed asynchronous system model equipped with a failure detector of the class O S . The proposed solution allows ro replicate a critical server while ensuring that the processing of all the incoming requests is consistent (mechanisms for solving the atomic broadcast problem) and predictable (mechanisms for solving the group priority inversion problem). Thus, the described request scheduling protocol is a key component which can be used to develop fault tolerant real time applications in a timed asynchronous system.

show abstract

Section: Introductionmentioning

confidence: 99%