Explore >> Select a destination
|
You are here 
|
speakerdeck.com | ||
| | | | |
martin.kleppmann.com
|
|
| | | | | ||
| | | | |
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... | |
| | | | |
databeta.wordpress.com
|
|
| | | | | For folks who care about what's possible in distributed computing: Peter Alvaro and I wrote an introduction to the CALM Theorem and subsequent work that is now up on arXiv. The CALM Theorem formally characterizes the class of programs that can achieve distributed consistency without the use of coordination. I spent a good fraction of... | |
| | | | |
marijnhaverbeke.nl
|
|
| | | |||
