Coordination-Free Designs for Mobile Gaming
summary
Claims that coordination can be minimized by designing with CRDTs and a dataflow/lattice model, implemented as the Lasp programming model embedded in Erlang, using an epidemic broadcast runtime. Demonstrates working artifacts: an eventually consistent top-K leaderboard and an ad counter that disables ads after 50,000 impressions, all replicated peer-to-peer, runtime and code on GitHub, and evaluation with Rovio use cases showing convergence without global locking.
AI-written summary · about
chapters (17)
- 0:00Start
- 1:30Distributed Register
- 4:48Review of Distributed Computation
- 5:57Consistency Models
- 7:40Problem of Time
- 8:18Mutable State
- 11:12Can We Build a System without Synchronization
- 11:43Strong Eventual Consistency
- 16:18Lattice Processing
- 18:52Inflationary Reads
- 20:38Referential Transparency
- 21:14Runtime
- 28:46Dynamic Scoping
- 29:37Pseudocode
- 31:18Ad Counter
- 32:06Data Flow Graph
- 34:12Divergence
related talks
40mDistributed, Eventually Consistent Computations
45mBuild better apps using CRDTs
29mCRDT: Conflict-free Data Types for Collaborative Editing and Offline-First
57mResponsibility Driven Design Revisited
32mCRDT and other new ideas for client-server communication
36mCRDTs Illustrated
36mCRDT Architecture and Group Systems
58mReactive DDD—When Concurrent Waxes Fluent