Linearizable State Machine Replication of State-Based CRDTs without Logs

Skrzypczak, Jan; Schintke, Florian; Schütt, Thorsten

doi:10.1145/3293611.3331568

Cited by 10 publications

(5 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In this context, a consistent quorum expresses a consistent view of the system in terms of group memberships. Skrzypczak et al [47] use consistent quorums to provide linearisable access to CRDTs. While this approach is similar to the protocol presented here, it heavily relies on the mathematical properties of CRDTs and can therefore not be used for general state machine replication.…”

Section: Related Workmentioning

confidence: 99%

RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

Skrzypczak

Schintke

Schütt

2020

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

Building consensus sequences based on distributed, fault-tolerant consensus, as used for replicated state machines, typically requires a separate distributed state for every new consensus instance. Allocating and maintaining this state causes significant overhead. In particular, freeing the distributed, outdated states in a fault-tolerant way is not trivial and adds further complexity and cost to the system. In this paper, we propose an extension to the single-decree Paxos protocol that can learn a sequence of consensus decisions 'in-place', i.e. with a single set of distributed states. Our protocol does not require dynamic log structures and hence has no need for distributed log pruning, snapshotting, compaction, or dynamic resource allocation. The protocol builds a fault-tolerant atomic register that supports arbitrary read-modify-write operations. We use the concept of consistent quorums to detect whether the previous consensus still needs to be consolidated or is already finished so that the next consensus value can be safely proposed. Reading a consolidated consensus is done without state modifications and is thereby free of concurrency control and demand for serialisation. A proposer that is not interrupted reaches agreement on consecutive consensus decisions within a single message round-trip per decision by preparing the acceptors eagerly with the previous request.

show abstract

Section: Related Workmentioning

confidence: 99%

RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

Skrzypczak

Schintke

Schütt

2020

IEEE Trans. Parallel Distrib. Syst.

Self Cite

View full text Add to dashboard Cite

show abstract

“…As a result, neither state machine replication nor primary-backup replication are suited to the edge use case: recent works including WPaxos [1] and Mencius [21] report that consensus protocols when run on the wide area impose per-message latencies of 100-200ms and can only support 10,000 operations per second or less. While, some of the recent literature on wide-area replication [15,22,35] have built on conflict-free replicated data types [33] (CRDTs) in order to address these performance limitations, adopting CRDT based techniques requires changes to application logic and a restructuring of application state, and hence these techniques cannot be used with general applications.…”

Section: Primary Backup Replication For Vms and Processesmentioning

confidence: 99%

Making edge-computing resilient

Harchol

Mushtaq

Fang

et al. 2020

Proceedings of the 11th ACM Symposium on Cloud Computing

View full text Add to dashboard Cite

The introduction of computational resources at the network edge allows application designers to offload computation from clients and/or servers, thereby reducing response latency and backbone bandwidth. More fundamentally, edge-computing moves applications from a client-server model to a client-edgeserver model. While this is an attractive paradigm for many use cases, it raises the question of how to design client-edgeserver systems so they can tolerate edge failures and client mobility. This is particularly challenging when edge processing is strongly stateful. In this paper we propose a design for meeting this challenge called the Client-Edge-Server for Stateful Network Applications (CESSNA). CCS Concepts • Networks → Programming interfaces; • Computer systems organization → Fault-tolerant network topologies.

show abstract

“…Operations started before the crash may be visible, because they progressed enough but did not return. The concept preserves important properties from linearizability, composability, and non-blocking progress [25,2,53].…”

Section: Durable Linearizabilitymentioning

confidence: 99%

Transactions on Red-black and AVL trees in NVRAM

Schütt¹,

Schintke²,

Skrzypczak³

2020

Preprint

Self Cite

View full text Add to dashboard Cite

Byte-addressable non-volatile memory (NVRAM) supports persistent storage with low latency and high bandwidth. Complex data structures in it ought to be updated transactionally, so that they remain recoverable at all times. Traditional database technologies such as keeping a separate log, a journal, or shadow data work on a coarse-grained level, where the whole transaction is made visible using a final atomic update operation. These methods typically need significant additional space overhead and induce non-trivial overhead for log pruning, state maintenance, and resource (de-)allocation. Thus, they are not necessarily the best choice for NVRAM, which supports fine-grained, byte-addressable access.We present a generic transaction mechanism to update dynamic complex data structures 'in-place' with a constant memory overhead. It is independent of the size of the data structure. We demonstrate and evaluate our approach on Red-Black Trees and AVL Trees with a redo log of constant size (4 resp. 2 cache lines). The redo log guarantees that each accepted (started) transaction is executed eventually despite arbitrary many system crashes and recoveries in the meantime. We update complex data structures in local and remote NVRAM providing exactly once semantics and durable linearizability for multi-reader single-writer access. To persist data, we use the available processor instructions for NVRAM in the local case and remote direct memory access (RDMA) combined with a software agent in the remote case.

show abstract

Linearizable State Machine Replication of State-Based CRDTs without Logs

Cited by 10 publications

References 17 publications

RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

RMWPaxos: Fault-Tolerant In-Place Consensus Sequences

Making edge-computing resilient

Transactions on Red-black and AVL trees in NVRAM

Contact Info

Product

Resources

About