Formalizing and Checking Multilevel Consistency

Bouajjani, Ahmed; Enea, Constantin; Mukund, Madhavan; Shenoy, R.G.; Suresh, S. P.

doi:10.1007/978-3-030-39322-9_18

Cited by 5 publications

(3 citation statements)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…It is also necessary to specify how one level influences another. For example, Bouajjani et al provide multi-level constraints for strong and weak consistency levels in [24].…”

Section: H Multi-level Constraintsmentioning

confidence: 99%

“…Burckhardt [2] provides the (vis, ar) specification framework for eventually consistent distributed data stores based on the visibility and arbitration relations. Bouajjani et al [24] provides a framework for specifying multilevel consistency. However, this framework is restricted to only two consistency levels, and is specific to a concrete implementation of data stores.…”

Section: Effect Of Deploymentmentioning

confidence: 99%

See 1 more Smart Citation

Tunable Causal Consistency: Specification and Implementation

Xue¹,

Wei²,

Huang³

2022

Preprint

View full text Add to dashboard Cite

To achieve high availability and low latency, distributed data stores often geographically replicate data at multiple sites called replicas. However, this introduces the data consistency problem. Due to the fundamental tradeoffs among consistency, availability, and latency in the presence of network partition, no a one-size-fits-all consistency model exists.To meet the needs of different applications, many popular data stores provide tunable consistency, allowing clients to specify the consistency level per individual operation. In this paper, we propose tunable causal consistency (TCC). It allows clients to choose the desired session guarantee for each operation, from the well-known four session guarantees, i.e., read your writes, monotonic reads, monotonic writes, and writes follow reads. Specifically, we first propose a formal specification of TCC in an extended (vis, ar) framework originally proposed by Burckhardt et al. Then we design a TCC protocol and develop a prototype distributed key-value store called TCCSTORE. We evaluate TCCSTORE on Aliyun. The latency is less than 38ms for all workloads and the throughput is up to about 2800 operations per second. We also show that TCC achieves better performance than causal consistency and requires a negligible overhead when compared with eventual consistency.

show abstract

“…It is also necessary to specify how one level influences another. For example, Bouajjani et al provide multi-level constraints for strong and weak consistency levels in [24].…”

Section: H Multi-level Constraintsmentioning

confidence: 99%

Section: Effect Of Deploymentmentioning

confidence: 99%

Tunable Causal Consistency: Specification and Implementation

Xue¹,

Wei²,

Huang³

2022

Preprint

View full text Add to dashboard Cite

show abstract

“…Therefore, system designers opted for weaker notions of consistency such as eventual [4,15,17,19,24,25,48,52] and causal [2,13,33] consistency that can provide availability, responsiveness and scalability but lose the same total order of operations. Several projects [16,49,51] provide programming interfaces for weak consistency notions. Unfortunately, the large collection of subtle weak consistency notions is unintuitive to users.…”

Section: Introductionmentioning

confidence: 99%

Hampa: Solver-Aided Recency-Aware Replication

Houshmand

Lesani

2020

Computer Aided Verification

View full text Add to dashboard Cite

Replication is a common technique to build reliable and scalable systems. Traditional strong consistency maintains the same total order of operations across replicas. This total order is the source of multiple desirable consistency properties: integrity, convergence and recency. However, maintaining the total order has proven to inhibit availability and performance. Weaker notions exhibit responsiveness and scalability; however, they forfeit the total order and hence its favorable properties. This project revives these properties with as little coordination as possible. It presents a tool called that given a sequential object with the declaration of its integrity and recency requirements, automatically synthesizes a correct-by-construction replicated object that simultaneously guarantees the three properties. It features a relational object specification language and a syntax-directed analysis that infers optimum staleness bounds. Further, it defines coordination-avoidance conditions and the operational semantics of replicated systems that provably guarantees the three properties. It characterizes the computational power and presents a protocol for recency-aware objects. uses automatic solvers statically and embeds them in the runtime to dynamically decide the validity of coordination-avoidance conditions. The experiments show that recency-aware objects reduce coordination and response time.

show abstract