Loading...
Please wait, while we are loading the content...
Similar Documents
Proceedings of the 3rd International Workshop on Principles and Practice of Consistency for Distributed Data (PaPoC'17)
| Content Provider | ACM Digital Library |
|---|---|
| Editor | Bieniusa, Annette Gotsman, Alexey |
| Copyright Year | 2017 |
| Abstract | 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. |
| ISBN | 9781450349338 |
| Language | English |
| Publisher | Association for Computing Machinery (ACM) |
| Publisher Date | 2017-04-23 |
| Access Restriction | Subscribed |
| Content Type | Text |
| Resource Type | Conference Proceedings |
