Regular Sequential Serializability and Regular Sequential Consistency

  title={Regular Sequential Serializability and Regular Sequential Consistency},
  author={Jeffrey Helt and Matthew Burke and Amit A. Levy and Wyatt Lloyd},
  journal={Proceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles},
Strictly serializable (linearizable) services appear to execute transactions (operations) sequentially, in an order consistent with real time. This restricts a transaction's (operation's) possible return values and in turn, simplifies application programming. In exchange, strictly serializable (linearizable) services perform worse than those with weaker consistency. But switching to such services can break applications. This work introduces two new consistency models to ease this trade-off… Expand

Figures and Tables from this paper


CockroachDB: The Resilient Geo-Distributed SQL Database
The design of CockroachDB and its novel transaction model that supports consistent geo-distributed transactions on commodity hardware is presented and its distributed SQL layer automatically scales with the size of the database cluster while providing the standard SQL interface that users expect. Expand
Building Consistent Transactions 17 SOSP ’21
  • Virtual Event, Germany Helt et al. with Inconsistent Replication. ACM Transactions on Computer Systems (TOCS)
  • 2018
Consistency in Non-Transactional Distributed Storage Systems
This article provides a structured and comprehensive overview of different consistency notions that appeared in distributed systems, and in particular storage systems research, in the last four decades, and defines precisely many of these, in particular where the previous definitions were ambiguous. Expand
Automating the Choice of Consistency Levels in Replicated Systems
This work presents SIEVE, a tool that relieves Java programmers from this errorprone decision process, allowing applications to automatically extract good performance when possible, while resorting to strong consistency whenever required by the target semantics. Expand
Multiwriter Consistency Conditions for Shared Memory Registers
This paper considers four possible definitions of multiwriter regularity, motivated by variations on a quorum-based algorithm schema for implementing them and gives a partial order describing the relative strengths of these consistency conditions. Expand
Regular Sequential Serializability and Regular Sequential Consistency
  • SOSP
  • 2021
Regular Sequential Serializability and Regular Sequential Consistency. arXiv:2109.08930 [cs.DC] SOSP ’21
  • October 26ś29,
  • 2021
Universal context propagation for distributed system instrumentation
This paper proposes a layered architecture for cross-cutting tools that separates concerns of system developers and tool developers, enabling independent instrumentation of systems, and the deployment and evolution of multiple such tools. Expand
Consistency , Availability , and Convergence
In an asynchronous system, it is shown that natural causal consistency, a strengthening of causal consistency that respects the real-time ordering of operations, provides a tight bound on consistency semantics that can be enforced without compromising availability and convergence. Expand
Lazy database replication with snapshot isolation
It is shown how snapshot isolation can be maintained in lazy replicated systems while taking full advantage of the local concurrency controls, and proposed strong session snapshot isolation, a correctness criterion that prevents transaction inversions. Expand