Introduction to Transactional Replication

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

doi:10.1007/978-3-319-14720-8_15

Cited by 4 publications

(4 citation statements)

References 30 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In order to capture the eventual stabilization of operation execution order in Bayou and systems similar to it, we need to define a few additional properties. Intuitively, from the point of view of strong operations, Bayou ensures linearizability [33]: all operations are executed sequentially according to the order established by TOB, as in the state machine replication [6] [35]. Linearizability is a very strong guarantee, impossible to achieve when one tries to optimize the execution of RO operations [36].…”

Section: Strong Consistencymentioning

confidence: 99%

On Mixing Eventual and Strong Consistency: Bayou Revisited

Kokociński

Kobus

Wojciechowski

2019

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

In this paper we study the properties of eventually consistent distributed systems that feature arbitrarily complex semantics and mix eventual and strong consistency. These systems execute requests in a highly-available, weakly-consistent fashion, but also enable stronger guarantees through additional inter-replica synchronization mechanisms that require the ability to solve distributed consensus. We use the seminal Bayou system as a case study, and then generalize our findings to a whole class of systems. We show dubious and unintuitive behaviour exhibited by those systems and provide a theoretical framework for reasoning about their correctness. We also state an impossibility result that formally proves the inherent limitation of such systems, namely temporary operation reordering, which admits interim disagreement between replicas on the relative order in which the client requests were executed.

show abstract

Section: Strong Consistencymentioning

confidence: 99%

On Mixing Eventual and Strong Consistency: Bayou Revisited

Kokociński

Kobus

Wojciechowski

2019

Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing

Self Cite

View full text Add to dashboard Cite

show abstract

“…Additionally, in DUR read-only transactions can be provided with abort-free execution guarantee by introducing the multiversioning scheme. [62] [26]. Multiversioning allows multiple versions of all transactional objects to be stored while being transparent to the programmer, i.e., at any moment only one version of any transactional object is accessible by a transaction.…”

Section: Smr Vs Dur Comparisonmentioning

confidence: 99%

“…As we discuss in Section 4, HTR shares many similarities with both SMR and DUR by allowing transactions to be executed either in a pessimistic or optimistic mode, resembling request or transaction execution in SMR or DUR, respectively. As SMR and DUR, HTR fits the framework of transactional replication (TR) [26], which formalizes the interaction between clients and the replicated system. The programming model of TR corresponds to Distributed Transactional Memory (DTM), as discussed below.…”

Section: Transactional Replicationmentioning

confidence: 99%

See 1 more Smart Citation

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

Meta-operation conflict resolution for human–human interaction in collaborative feature-based CAD systems

Cheng

et al. 2016

Cluster Comput

View full text Add to dashboard Cite

Introduction to Transactional Replication

Cited by 4 publications

References 30 publications

On Mixing Eventual and Strong Consistency: Bayou Revisited

On Mixing Eventual and Strong Consistency: Bayou Revisited

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

Meta-operation conflict resolution for human–human interaction in collaborative feature-based CAD systems

Contact Info

Product

Resources

About