Semi-passive replication and Lazy Consensus

Défago, Xavier; Schiper, André

doi:10.1016/j.jpdc.2004.08.006

Cited by 19 publications

(16 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…A new style of replication, called semi-passive replication [47][48][49], is devised to overcome the slow response of passive replication. In semi-passive replication, a request is sent to all replicas, where only one replica handles the request, after which, it generates a reply message for the client and an update message for the other replicas.…”

Section: Replication Schemesmentioning

confidence: 99%

Survey and future directions of fault-tolerant distributed computing on board spacecraft

Fayyaz

Vladimirova

2016

Advances in Space Research

View full text Add to dashboard Cite

Current and future space missions demand highly reliable on-board computing systems, which are capable to carry out high-performance data processing. At present no single computing scheme could efficiently tackle high-performance computing as well as reliability. This paper aims to address that gap. In the first part of the paper, a detailed survey of fault-tolerant distributed computing systems for space applications is presented. Fault types and performance parameters for assessment of a fault-tolerant system are introduced. Redundancy schemes for distributed systems are analysed. A review of the state-of-the-art on fault-tolerant distributed systems is presented and limitations of current approaches are discussed. In the second part of the paper, a new fault-tolerant distributed computing platform with wireless links among the computing nodes is proposed. Novel algorithms, enabling important aspects of the architecture, such as time slot priority adaptive fault-tolerant channel access and fault-tolerant distributed computing using task migration are introduced.

show abstract

Section: Replication Schemesmentioning

confidence: 99%

Survey and future directions of fault-tolerant distributed computing on board spacecraft

Fayyaz

Vladimirova

2016

Advances in Space Research

View full text Add to dashboard Cite

show abstract

“…Defago et al [36,37] have investigated semi-passive replication along with a consensus algorithm. Their model admits non-deterministic operations, but not concurrent processing, with shared data, of requests from multiple clients.…”

Section: Related Workmentioning

confidence: 99%

Low Latency Fault Tolerance System

Zhao

Melliar-Smith

Moser

2012

The Computer Journal

View full text Add to dashboard Cite

The Low Latency Fault Tolerance (LLFT) system provides fault tolerance for distributed applications within a local-area network, using a leader-follower replication strategy. LLFT provides application-transparent replication, with strong replica consistency, for applications that involve multiple interacting processes or threads. Its novel system model enables LLFT to maintain a single consistent infinite computation, despite faults and asynchronous communication. The LLFT Messaging Protocol provides reliable, totally-ordered message delivery by employing a group multicast, where the message ordering is determined by the primary replica in the destination group. The Leader-Determined Membership Protocol provides reconfiguration and recovery when a replica becomes faulty and when a replica joins or leaves a group, where the membership of the group is determined by the primary replica. The Virtual Determinizer Framework captures the ordering information at the primary replica and enforces the same ordering of non-deterministic operations at the backup replicas. LLFT does not employ a majority-based, multiple-round consensus algorithm and, thus, it can operate in the common industrial case where there is a primary replica and only one backup replica. The LLFT system achieves low latency message delivery during normal operation and low latency reconfiguration and recovery when a fault occurs.

show abstract

“…In [10], it is proposed both 3S-and Ω-based implementations for LAMBDA(-, -); they allow deterministic solutions to consensus, provided that the assumptions required for the oracles to work properly are satisfied (let us name these protocols GR-3S-consensus and GR-Ω-consensus, respectively) 7 . The resulting protocols are as efficient as any ad-hoc protocol designed for the corresponding oracle [10].…”

Section: Algorithm 1 a Generic Indulgent Consensus Protocolmentioning

confidence: 99%

“…Further, the commitment phase can only finish when at least n − f processes finish the corresponding selection phase. 7 An implementation that uses a random oracle to implement LAMBDA(-, -) is also proposed; it solves the probabilistic version of the consensus problem.…”

Section: Features Of An Adaptive Process Ordering Modulementioning

confidence: 99%

“…Since a single invocation of consensus can carry propositions from several applications (for instance, by using the mechanisms proposed in [12]), a cheap way to achieve the required agreement is by using the very consensus protocol to which the adaptive process ordering service is associated [7]. In this case, the consensus protocol will decide on application values and on a process ordering value.…”

Section: An Implementation Of An Adaptive Process Ordering Modulementioning

confidence: 99%

See 1 more Smart Citation

Adaptive Indulgent Consensus

Sampaio

Brasileiro

2005 International Conference on Dependable Systems and Networks (DSN'05)

View full text Add to dashboard Cite

Due to their fundamental role in the design of faulttolerant distributed systems, consensus protocols have been widely studied. In particular, design and performance issues of indulgent consensus is a research topic that has gained considerable attention. Most of these protocols are asymmetric in the sense that different participants can assume different roles during the execution of the protocol. Usually, there is a process that assumes a "special" role and the others cooperate with it to finish the computation. However, the asymmetric structure of indulgent consensus protocols has a performance pitfall, specially when processes and communication channels are subject to considerable variability in load. The problem is that such protocols use an a priori agreed process ordering to select the process to perform the "special" role. We advocate that adaptive indulgent consensus protocols can be constructed by the introduction of an adaptive process ordering module. In this sense, it is proposed a generic implementation for this module. Based on this generic module we provide implementations of both 3S-and Ω-based adaptive indulgent consensus protocols. Further, we investigate their performance by means of simulation and real experiments over a widely distributed system. The experimental results obtained show that the adaptive consensus protocols can outperform their non-adaptive counterparts in as much as 50%.

show abstract

Semi-passive replication and Lazy Consensus

Cited by 19 publications

References 34 publications

Survey and future directions of fault-tolerant distributed computing on board spacecraft

Survey and future directions of fault-tolerant distributed computing on board spacecraft

Low Latency Fault Tolerance System

Adaptive Indulgent Consensus

Contact Info

Product

Resources

About