Make the Leader Work: Executive Deferred Update Replication

Kokociński, Maciej; Kobus, Tadeusz; Wojciechowski, Paweł T.

doi:10.1109/srds.2014.42

Cited by 5 publications

(4 citation statements)

References 10 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is inspired by the design of some total order broadcast protocols, such as Zab [25] and Viewstamped Replication [37]. Kokocinski et al [28] have previously explored the idea of delegating the certification decision to a single leader in the context of deferred update replication. However, they only considered a non-sharded setting, and did not provide full implementation details and a correctness proof.…”

Section: Related Workmentioning

confidence: 99%

Multi-shot distributed transaction commit

Chockler

Gotsman

2021

Distrib. Comput.

View full text Add to dashboard Cite

Atomic Commit Problem (ACP) is a single-shot agreement problem similar to consensus, meant to model the properties of transaction commit protocols in fault-prone distributed systems. We argue that ACP is too restrictive to capture the complexities of modern transactional data stores, where commit protocols are integrated with concurrency control, and their executions for different transactions are interdependent. As an alternative, we introduce Transaction Certification Service (TCS), a new formal problem that captures safety guarantees of multi-shot transaction commit protocols with integrated concurrency control. TCS is parameterized by a certification function that can be instantiated to support common isolation levels, such as serializability and snapshot isolation. We then derive a provably correct crash-resilient protocol for implementing TCS through successive refinement. Our protocol achieves a better time complexity than mainstream approaches that layer two-phase commit on top of Paxos-style replication.

show abstract

Section: Related Workmentioning

confidence: 99%

Multi-shot distributed transaction commit

Chockler

Gotsman

2021

Distrib. Comput.

View full text Add to dashboard Cite

show abstract

“…Hence, the order of strong operations established by CAB could be different from the order following from the causal dependency we would have had defined. In principle, such dependencies could be enforced using Zab [45] or executive order broadcast [46]. However, these schemes would have to be extended to accommodate the capabilities of CAB.…”

Section: A Basic Schemementioning

confidence: 99%

Creek: Low-latency, Mixed-Consistency Transactional Replication Scheme

Kobus¹,

Kokociński²,

Wojciechowski³

2019

Preprint

Self Cite

View full text Add to dashboard Cite

In this paper we introduce Creek, a low-latency, eventually consistent replication scheme that also enables execution of strongly consistent requests. Creek disseminates the messages among the replicas using only a gossip protocol. Similarly to state machine replication (SMR), Creek totallyorders all requests, but does so using two different mechanisms: a timestamp-based one and one built on top of our novel broadcast primitive, conditional atomic broadcast (CAB). The former is used to establish a tentative order of all requests for speculative execution and works also within each partition, when partitioning of network occurs. On the other hand, CAB is used only for the strongly consistent requests to ensure their linearizable execution, and is available whenever distributed consensus can be solved. The execution of a strongly consistent request also stabilizes the execution order of the causally related weakly consistent requests. Creek uses multiversion concurrency control to efficiently handle requests' rollbacks and reexecutions resulting from the mismatch between the tentative and the final execution orders. In the tests conducted using the TPC-C benchmark, Creek offers up to 3 times lower latency in returning client responses compared to the state-of-the-art speculative SMR scheme, while maintaining high accuracy of the speculative execution (92-100%).

show abstract

“…PolyCert [28] can switch between three TOB-based certification protocols, which differ in the way the readsets of updating transactions are handled. Executive DUR (E-DUR) [29] streamlines transaction certification with the leader of the Paxos protocol. Note that all the above mentioned protocols are aimed only at increasing the throughput of DUR and not at extending the transactional semantics of the base protocol, as in case of HTR (see also Section 2.3).…”

Section: Transactional Replicationmentioning

confidence: 99%

“…We added the HTR functionality to Paxos STM [4], which is an object-based DTM system that we developed to compare SMR and DUR and then used as a testbed for the E-DUR scheme [29]. It builds on JPaxos [32]-a highly optimized implementation of the Paxos algorithm [33].…”

Section: Distributed Transactional Memory Systemsmentioning

confidence: 99%

Hybrid Transactional Replication: State-Machine and Deferred-Update Replication Combined

Kobus

Kokociński

Wojciechowski

2018

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Abstract-We propose Hybrid Transactional Replication (HTR) a novel replication scheme for highly dependable services. It combines two schemes: a transaction is executed either optimistically by only one service replica in the deferred update mode (DU), or deterministically by all replicas in the state machine mode (SM); the choice is made by an oracle. The DU mode allows for parallelism and thus takes advantage of multicore hardware. In contrast to DU, the SM mode guarantees abort-free execution, so it is suitable for irrevocable operations and transactions generating high contention. For expressiveness, transactions can be discarded or retried on demand. We formally prove that the higher flexibility of the scheme does not come at the cost of weaker guarantees for clients: HTR satisfies strong consistency guarantees akin to those provided by other popular transactional replication schemes such as Deferred Update Replication. We developed HTR-enabled Paxos STM, an object-based distributed transactional memory system, and evaluated it thoroughly under various workloads. We show the benefits of using a novel oracle, which relies on machine learning techniques for automatic adaptation to changing conditions. In our tests, the ML-based oracle provides up to 50% improvement in throughput when compared to the system running with DU-only or SM-only oracles. Our approach is inspired by a well known algorithm used in the context of the multi-armed bandit problem.

show abstract

Make the Leader Work: Executive Deferred Update Replication

Cited by 5 publications

References 10 publications

Multi-shot distributed transaction commit

Multi-shot distributed transaction commit

Creek: Low-latency, Mixed-Consistency Transactional Replication Scheme

Hybrid Transactional Replication: State-Machine and Deferred-Update Replication Combined

Contact Info

Product

Resources

About