Easy Eventual Consistency with Actor Models and AWS
I found a way to ‘cheat’ the CAP theorem, and in this session, I’ll show you how to do it. No, seriously
The CAP theorem is a very difficult problem to solve in distributed systems, but it turns out that there are a few simple rules that you can follow to get strong eventual consistency in the cloud. These rules can work in almost any programming language, and I’ll talk about what it take to make it all happen. At Domain, we used these principles to recover from catastrophic data failures in our clickstream events, and in this session, I’ll show you how we did it.
With CRDTs + Event Sourcing and its intrinsic immutability, there’s a mathematically provable way to ensure that all nodes in a distributed system (such as a data store, or an Akka.NET grid) get the same level of consistency without even talking to each other.