|
You are here |
ongardie.github.io | ||
| | | | |
emptysqua.re
|
|
| | | | | Which consensus algorithm will win? | |
| | | | |
briankung.dev
|
|
| | | | | I survived David Beazley's weeklong course on the Raft consensus algorithm that powers technologies like Kubernetes, MongoDB, and Neo4j. Image from https://raft.github.io/ The Raft Consensus Algorithm is a way for a gaggle of computers to agree on a sequence of events, or a "log" of events. Raft is useful for things like databases - once... | |
| | | | |
timilearning.com
|
|
| | | | | One common pattern in the previous systems we have discussed like MapReduce, GFS, and VMware FT is that they all rely on a single entity to make the key decisions. While this has the advantage of making it easier for the system to decide, the downside of this approach is that the entity is now a single point of failure. In this post, we'll learn how the Raft consensus algorithm solves this problem. | |
| | | | |
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... | ||