Explore >> Select a destination
|
You are here 
|
blog.thislongrun.com | ||
| | | | |
alexdebrie.com
|
|
| | | | | In this post, understand the different concepts of consistency as applied to distributed databases, as well as some issues with the conversation of consistency. | |
| | | | |
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. | |
| | | | |
paulkernfeld.com
|
|
| | | | | Mostly software: Rust, machine learning, and P2P systems. Previously, games and cocktails. | |
| | | | |
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... | ||
