Blogs (61) >>
ECOOP and ISSTA
Sun 15 - Sat 21 July 2018 Amsterdam, Netherlands
Mon 16 Jul 2018 13:50 - 14:30 at Matterhorn II - Track 2

When it comes to distributed systems, coordination is slow. This is true whether we’re talking about a system that favors consistency or one that favors high availability. CRDTs are data structures that promise strong eventual consistency for highly available systems without the costs of coordination. A gossip protocol will do the trick. If you’ve read anything about the theory behind state-based convergent CRDTs, you may have run across the term “monotonic join semi-lattice.” Despite the intimidating name, this concept (drawn from order theory) is built out of familiar elements. And rather than indicating that you need an advanced degree in mathematics to understand how CRDTs work, it turns out that with a little work, it can help clarify why, when it comes to state-based CRDTs, you can rely on gossip to get your system to converge on the One True Value. In this talk, I’m going to start from the familiar elements constituting a join semi-lattice and build up to the complete concept. I’ll then explain how state-based CRDTs work, relying on the lessons we’ve learned from order theory.

Mon 16 Jul

curryon-2018-CurryOn-Talks
13:50 - 15:20: Curry On Talks - Track 2 at Matterhorn II
curryon-2018-CurryOn-Talks13:50 - 14:30
Talk
John MummVectrology Solutions
curryon-2018-CurryOn-Talks14:40 - 15:20
Talk
Tamás Szabóitemis AG / TU Delft, Sebastian ErdwegTU Delft