Easy Eventual Consistency

Nov 17, 2016 · Sydney, Australia

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. I'll be doing the code samples in F#, as well as talk about the rules 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 +  the immutability that is built into F#, 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. 

It's not magic--it's just good maths. Join me, and you'll be surprised at just how easy it is.

Philip Laureano is going cover some seriously interesting ground in this talk. I think we're in for a treat!

You can follow Philip on twitter @philiplaureano

Event organizers
  • F# Sydney

    The F# programming language is like a typed Python. The F# language was carefully crafted to have the ease of a scripted language, without run-time wait-and-see surprises.  With F#, you also get the instant REPL feedback which we normally associated interpreted languages. So, you get more action with less fuss... and you get to keep that sure-footed certainty, without getting clumsy. At least ...

    Recent Events
    More

Are you organizing Easy Eventual Consistency?

Claim the event and start manage its content.

I am the organizer
Social
Rating

based on 0 reviews