Separating agreement from execution for byzantine fault tolerant services

Yin, Jie; Martin, Jean‐Philippe; Venkataramani, Arun; Alvisi, Lorenzo; Dahlin, Mike

doi:10.1145/945469.945470

Cited by 102 publications

(105 citation statements)

References 0 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…We advocate to separate agreement from execution [18] where the total ordering of requests is accomplished using a separate agreement cluster, and the replicas are dedicated to request processing only. The number of agreement nodes needed depends on the algorithms used for total ordering.…”

Section: System Modelmentioning

confidence: 99%

See 1 more Smart Citation

High-throughput state-machine replication using software transactional memory

Zhao

Yang²,

Zhang

et al. 2016

J Supercomput

View full text Add to dashboard Cite

State-machine replication is a common way of constructing general purpose fault tolerance systems. To ensure replica consistency, requests must be executed sequentially according to some total order at all non-faulty replicas. Unfortunately, this could severely limit the system throughput. This issue has been partially addressed by identifying non-conflicting requests based on application semantics and executing these requests concurrently. However, identifying and tracking non-conflicting requests require intimate knowledge of application design and implementation, and a custom fault tolerance solution developed for one application cannot be easily adopted by other applications. Software transactional memory offers a new way of constructing concurrent programs. In this article, we present the mechanisms needed to retrofit existing concurrency control algorithms designed for software transactional memory for state-machine replication. The main benefit for using software transactional memory in state-machine replication is that general purpose concurrency control mechanisms can be designed without deep knowledge of application semantics. As such, new fault tolerance systems based on state-machine replications with excellent throughput can be easily designed and maintained. In this article, we introduce three different concurrency control mechanisms for state-machine replication using software transactional memory, namely, ordered strong strict two-phase locking, conventional timestamp-based multiversion concurrency control, and speculative timestamp-based multiversion concurrency control. Our experiments show that speculative timestamp-based multiversion concurrency control mechanism has the best performance in all types of workload, the conventional timestamp-based multiversion concurrency control offers the worst performance due to high abort rate in the presence of even moderate contention between transactions. The ordered strong strict two-phase locking mechanism offers the simplest solution with excellent performance in low contention workload, and fairly good performance in high contention workload.

show abstract

Section: System Modelmentioning

confidence: 99%

“…Due to the separation of agreement from execution [5,18], the replicas do not participate in the total ordering of requests. All replicas are equal in that no replica makes decision for other replicas.…”

Section: Implementation and Performance Evaluationmentioning

confidence: 99%

High-throughput state-machine replication using software transactional memory

Zhao

Yang²,

Zhang

et al. 2016

J Supercomput

View full text Add to dashboard Cite

show abstract

“…System model Nova separates agreement from execution, we assume faulty replicas in agreement cluster are no more than f and faulty ones in execution cluster are no more than g. Based on SEP [13], the agreement cluster n ≥ 3f +1, and the execution cluster m ≥ 2g +1. We assume that malicious replicas can control the communication channels, the message in communication may be discarded, shuffle or repeat transferred, malicious nodes can also collude to deceive the correct nodes to damage the consistency of system state.…”

Section: Nova Protocol Designmentioning

confidence: 99%

Nova: A Robustness-oriented Byzantine Fault Tolerance Protocol

Pei

Wang

Luan

2010

2010 Ninth International Conference on Grid and Cloud Computing

View full text Add to dashboard Cite

With the increased complexity, malicious faults have become an important reasons that affect the reliability of the distributed system, especially the web-scale infrastructures, i.e. Amazon S3, Google AppEngine etc. Most such systems assume benign fault model which can't depict the malicious actions. The goal of Byzantine Fault Tolerance protocol (BFT for short) is to mask the malicious behaviors and it has been proved that some new proposed BFTs are suitable to support practical applications. But these BFTs still lack in robustness, a simple fault injection may cause significantly decrease in throughput or run in low throughput without violating the BFT safety property. We propose a new robustness-oriented BFT named Nova. Experiments show Nova has comparable throughput as PBFT in normal case and behave stably under the malicious attack. Compared with other BFTs, Nova can support practical applications more effectively.

show abstract

“…Second, mounting evidence of non-fail-stop behavior in real systems [2,5,6,27,30,32,36,39,40] suggest that BFT may yield significant benefits even without resorting to n-version programming [4,15,33]. Third, improvements to the state of the art in BFT replication techniques [3,9,10,18,33,41] make BFT replication increasingly practical by narrowing the gap between BFT replication costs and costs already being paid for non-BFT replication. For example, by default, the Google file system uses 3-way replication of storage, which is roughly the cost of BFT replication for f = 1 failures with 4 agreement nodes and 3 execution nodes [41].…”

Section: Introductionmentioning

confidence: 99%

“…Like traditional state machine replication protocols [9,33,41], a primary proposes an order on client requests to the other replicas. In Zyzzyva, unlike in traditional protocols, replicas speculatively execute requests without running an expensive agreement protocol to definitively establish the order.…”

Section: Introductionmentioning

confidence: 99%

Zyzzyva

Kotla

Alvisi

Dahlin

et al. 2007

Proceedings of Twenty-First ACM SIGOPS Symposium on Operating Systems Principles

Self Cite

359

View full text Add to dashboard Cite

We present Zyzzyva, a protocol that uses speculation to reduce the cost and simplify the design of Byzantine fault tolerant state machine replication. In Zyzzyva, replicas respond to a client's request without first running an expensive three-phase commit protocol to reach agreement on the order in which the request must be processed. Instead, they optimistically adopt the order proposed by the primary and respond immediately to the client. Replicas can thus become temporarily inconsistent with one another, but clients detect inconsistencies, help correct replicas converge on a single total ordering of requests, and only rely on responses that are consistent with this total order. This approach allows Zyzzyva to reduce replication overheads to near their theoretical minima.

show abstract

Separating agreement from execution for byzantine fault tolerant services

Cited by 102 publications

References 0 publications

High-throughput state-machine replication using software transactional memory

High-throughput state-machine replication using software transactional memory

Nova: A Robustness-oriented Byzantine Fault Tolerance Protocol

Zyzzyva

Contact Info

Product

Resources

About