Export Citations
PaPoC '17: Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data
2017 Proceeding- Editors:
- Annette Bieniusa,
- Alexey Gotsman
- Sponsor:
- sigops
Consistency is one of the fundamental issues of distributed computing. There are many competing consistency models, with subtly different power in principle. In practice, the well known the Consistency-Availability-Partition Tolerance trade-off translates to difficult choices between fault tolerance, performance, and programmability. The issues and trade-offs are particularly vexing at scale, with a large number of processes or a large shared database, and in the presence of high latency and failure-prone networks. It is clear that there is no one universally best solution. Possible approaches cover the whole spectrum between strong and eventual consistency. Strong consistency (linearizability or serializability, achieved via total ordering) provides familiar and intuitive semantics but requires slow and fragile synchronization and coordination overheads. The unlimited parallelism allowed by weaker models such as eventual consistency promises high performance, but divergence and conflicts make it difficult to ensure useful application invariants, and metadata is hard to keep in check. The research and development communities are actively exploring intermediate models (replicated data types, monotonic programming, CRDTs, LVars, causal consistency, red-blue consistency, invariant- and proof-based systems, etc.), designed to improve efficiency, programmability, and overall operation without negatively impacting scalability.
pluto: The CRDT-Driven IMAP Server
A typical cloud deployment of an IMAP service follows the service-statelessness principle, i.e. a load balancer distributes the requests to a mostly stateless backend that stores application state on a network file system like NFS. Within this work we ...
Compact Resettable Counters through Causal Stability
Conflict-free Data Types (CRDTs) were designed to automatically resolve conflicts in eventually consistent systems. Different CRDTs were designed in both operation-based and state-based flavors such as Counters, Sets, Registers, Maps, etc. In a previous ...
Testing properties of weakly consistent programs with Repliss
Repliss is a tool for the verification of programs which are built on top of weakly consistent databases. As one part of Repliss, we have built an automated, property based testing engine. It explores executions of a given application with randomized ...
Borrowing an Identity for a Distributed Counter: Work in progress report
Conflict-free Replicated Data Types (CRDTs) are data abstractions (registers, counters, sets, maps, among others) that provide a relaxed consistency model called Eventual Consistency. Current designs for CRDT counters do not scale, having a size linear ...
As Secure as Possible Eventual Consistency: Work in Progress
Eventual consistency (EC) is a relaxed data consistency model that, driven by the CAP theorem, trades prompt consistency for high availability. Although, this model has shown to be promising and greatly adopted by industry, the state of the art only ...
Bringing Hybrid Consistency Closer to Programmers
Hybrid consistency is a new consistency model that tries to combine the benefits of weak and strong consistency. To implement hybrid consistency, programmers have to identify conflicting operations in applications and instrument them, which is a ...
FMKe: a Real-World Benchmark for Key-Value Data Stores
- Gonçalo Tomás,
- Peter Zeller,
- Valter Balegas,
- Deepthi Akkoorath,
- Annette Bieniusa,
- João Leitão,
- Nuno Preguiça
Standard benchmarks are essential tools to enable developers to validate and evaluate their systems' design in terms of both relevant properties and performance. Benchmarks provide the means to evaluate a system with workloads that mimics real use cases. ...
Transparent cross-system consistency
This paper discusses the motivation and the challenges for providing a systematic and transparent approach for dealing with cross-system consistency. Our high level goal is to provide a way to avoid violations of causality when multiple systems interact,...
Index Terms
- Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data
Recommendations
Adaptive State Consistency for Distributed ONOS Controllers
2018 IEEE Global Communications Conference (GLOBECOM)-Logically-centralized but physically-distributed SDN controllers are mainly used in large-scale SDN networks for scalability, performance and reliability reasons. These controllers host various applications that have different requirements in terms of ...