State and the distributed data structures
In this talk I present the concept of CRDTs, data structures which allow to replicate the state in a distributed system with guaranteed eventual consistency.
Properties of CRDTs (particularly the state-based ones) ensure that despite of failing nodes and network partitions, the state of all replicas will eventually converge to the same value. I try to focus on high-level requirements and caveats rather than code examples and specific implementations, although you’ll find them here as well.
The talk was presented for the first time at ElixirConf EU 2018.
Arkadiusz Gil
April 16, 2018