Software Engineering Radio - the podcast for professional software developers SE-Radio Episode 252: Christopher Meiklejohn on CRDTs
Mar 15, 2016
Chapters
Transcript
Episode notes
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21
Introduction
00:00 • 2min
The History of Replication in Distributed Systems
01:58 • 2min
How to Avoid Conflicts in a Distributed System
03:48 • 4min
How to Resolve Conflicts in Asynchronous Networks
07:26 • 2min
The CRDT Way of Thinking
09:36 • 2min
The Design Space Around Conflict Resolution
11:28 • 2min
What Is a Conflict Free Replicated Data Type?
13:56 • 2min
How to Model Sequential Data Types in a Distributed Fashion
16:07 • 3min
How to Solve a Distributed System Problem in a General Way
18:50 • 3min
The Importance of a Deterministic Method of Resolving Conflicts
21:53 • 2min
The Difference Between Community of and Convergent Replicated Data Types
23:41 • 4min
CRDTs: A State Based Implementation of Counters
27:24 • 2min
The Problem With a Positive Negative Counter
29:52 • 2min
The Conflict Free Replicated Sets
31:39 • 3min
The Cost of Keeping More State and More History on the CRDTs
34:50 • 3min
The Popular Use Cases for CRDTs
37:29 • 2min
CRDTs and Strong Eventual Consistency
39:49 • 3min
The Dynamo Paper on Amazon's Shopping Cart
42:45 • 4min
How to Implement CRDTs Correctly
46:16 • 5min
Programming Abstractions With CRDTs
50:50 • 2min
The Future of Programming Languages
53:11 • 2min