Explore >> Select a destination
|
You are here 
|
blog.thislongrun.com | ||
| | | | |
blog.dtornow.com
|
|
| | | | | The CAP theorem is too simplistic and too widely misunderstood to be of much use for characterizing systems. Therefore I ask that we retire all references to the CAP theorem, stop talking about the CAP theorem, and put the poor thing to rest Martin Kleppmann In 2000, Eric Brewer introduced the CAP Conjecture during his keynote address Towards Robust Distributed Systems at the Principles of Distributed Computing conference. Brewer posited that a distributed system cannot achieve Consistency, Availability, and Partition Tolerance simultaneously. | |
| | | | |
go.redpanda.com
|
|
| | | | | Kyle Kingsbury has made a career of improving the safety of distributed systems. With his Jepsen test, he explores whether a system lives up to its claims, files new bugs, and makes recommendations for operators. | |
| | | | |
www.adamconrad.dev
|
|
| | | | | Ch 9 of my book club review of Designing Data-Intensive Applications by Martin Kleppmann. | |
| | | | |
algorithmsoup.wordpress.com
|
|
| | | The ``probabilistic method'' is the art of applying probabilistic thinking to non-probabilistic problems. Applications of the probabilistic method often feel like magic. Here is my favorite example: Theorem (Erdös, 1965). Call a set $latex {X}&fg=000000$ sum-free if for all $latex {a, b \in X}&fg=000000$, we have $latex {a + b \not\in X}&fg=000000$. For any finite... | ||
