Explore >> Select a destination
|
You are here 
|
databeta.wordpress.com | ||
| | | | |
bloom-lang.net
|
|
| | | | | CALM: consistency as logical monotonicity One of the key innovations underlying Bloom is the ability to formally guarantee consistency properties of distributed programs. This reasoning is based o | |
| | | | |
robertovitillo.com
|
|
| | | | | Coordination is expensive as it reduces the availability and performance of distributed applications (PACELC theorem). I have extended chapter 10 of Understanding Distributed Systems with a discussion of how to minimize coordination using one of the following patterns: Keep coordination off the critical path Use protocols that guarantee some form of consistency without coordination Proceed without coordination and apologize when an inconsistency is detected Section 10.4 describes chain replication, a wid... | |
| | | | |
sookocheff.com
|
|
| | | | | Title and Author of Paper Consistency Analysis in Bloom: a CALM and Collected Approach. Alvaro et al. Summary Distributed programming is difficult for even experienced developers to get correct. Understanding the tradeoff between consistency, availability, and latency, while guaranteeing data correctness, provides a wealth of problems for the application developer. This paper presents a language and method for programmatically verifying distributed consistency. CALM - Consistency and Logical Monotonicity... | |
| | | | |
sookocheff.com
|
|
| | | Title and Author of Paper Generalized Isolation Level Definitions, Adya et al. Summary The ANSI SQL standard defines isolation levels allowing database users to trade off between performance and consistency when running transactions. Unfortunately, the wording in the SQL standard is geared towards locking as the sole supported concurrency method. This paper presents alternative definitions to the isolation levels specified in the ANSI SQL standard that are general enough to allow for any concurrency method (multi-version, optimistic, etc.) to be used. | ||
