You are here |
compositecode.blog | ||
| | | |
blog.thislongrun.com
|
|
| | | | CAP theorem: node failure, process crash vs. partition and availability. | |
| | | |
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. | |
| | | |
blog.thislongrun.com
|
|
| | | | CAP theorem and databases: definitions of ACID, Atomic, Consistent, Isolated, Durable vs. available and partition. | |
| | | |
www.mattritter.me
|
|
| | Background Lately I've been studying consensus algorithms to bolster my understanding of distributed systems. Consensus algorithms achieve agreement on data that is replicated across many nod... |