A Fault-Tolerant Sequentially Consistent DSM with a Compositional Correctness Proof

Ekström, Niklas; Haridi, Seif

doi:10.1007/978-3-319-46140-3_14

Cited by 3 publications

(1 citation statement)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is shown in [20] that, from an implementation point of view, sequential consistency can be seen as a form of lazy linearizability. The "compositional" power of sequential consistency is addressed in [8,18].…”

Section: R1write(2)mentioning

confidence: 99%

Extending Causal Consistency to any Object Defined by a Sequential Specification

Mostéfaoui,

Perrin,

Raynal

2018

Preprint

View full text Add to dashboard Cite

show abstract

Section: R1write(2)mentioning

confidence: 99%

Extending Causal Consistency to any Object Defined by a Sequential Specification

Mostéfaoui,

Perrin,

Raynal

2018

Preprint

View full text Add to dashboard Cite

show abstract

Fault-tolerant Snapshot Objects in Message Passing Systems

Garg

Kumar

Tseng

et al. 2022

2022 IEEE International Parallel and Distributed Processing Symposium (IPDPS)

View full text Add to dashboard Cite

Hermes: A Fast, Fault-Tolerant and Linearizable Replication Protocol

Katsarakis

Gavrielatos

Katebzadeh

et al. 2020

Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Syste

View full text Add to dashboard Cite

Today's datacenter applications are underpinned by datastores that are responsible for providing availability, consistency, and performance. For high availability in the presence of failures, these datastores replicate data across several nodes. This is accomplished with the help of a reliable replication protocol that is responsible for maintaining the replicas strongly-consistent even when faults occur. Strong consistency is preferred to weaker consistency models that cannot guarantee an intuitive behavior for the clients. Furthermore, to accommodate high demand at real-time latencies, datastores must deliver high throughput and low latency.This work introduces Hermes 1 , a broadcast-based reliable replication protocol for in-memory datastores that provides both high throughput and low latency by enabling local reads and fully-concurrent fast writes at all replicas. Hermes couples logical timestamps with cache-coherence-inspired invalidations to guarantee linearizability, avoid write serialization at a centralized ordering point, resolve write conflicts locally at each replica (hence ensuring that writes never abort) and provide fault-tolerance via replayable writes. Our implementation of Hermes over an RDMA-enabled reliable datastore with five replicas shows that Hermes consistently achieves higher throughput than state-of-the-art RDMA-based reliable protocols (ZAB and CRAQ) across all write ratios while also significantly reducing tail latency. At 5% writes, the tail latency of Hermes is 3.6× lower than that of CRAQ and ZAB.

show abstract

A Fault-Tolerant Sequentially Consistent DSM with a Compositional Correctness Proof

Cited by 3 publications

References 12 publications

Extending Causal Consistency to any Object Defined by a Sequential Specification

Extending Causal Consistency to any Object Defined by a Sequential Specification

Fault-tolerant Snapshot Objects in Message Passing Systems

Hermes: A Fast, Fault-Tolerant and Linearizable Replication Protocol

Contact Info

Product

Resources

About