Distributed, Eventually Consistent Computations
summary
Claims a coordination-free programming model called Lasp that composes CRDTs with a distributed dataflow to get Strong Eventual Consistency. Implements the runtime in Erlang, uses gossip-style selective hearing for dissemination, and demonstrates a mobile-game ad counter that converges without central locking. Prototype exists (a 0.01 release), folds and filters require associative, commutative, idempotent functions, and metadata growth and fold generality remain practical limits to measure in real deployments.
AI-written summary · about
chapters (16)
- 0:00Intro
- 2:13Difficult Cases
- 3:44Zero Synchronization
- 7:46Distributed Computation
- 10:50The Avatars of Time
- 13:06Parable of the Car
- 15:27Weak Synchronization
- 18:17Programming SEC
- 20:04Conflict-Free Replicated Data Types
- 23:57Lattice Processing (Lasp)
- 26:43Lasp Processes
- 31:50Selective Hearing
- 35:12Advertisement Counter
- 36:25What's Next?
- 38:34Key Points
- 39:21Lasp Release 0.0.1
related talks
44mCoordination-Free Designs for Mobile Gaming
33mConvergent/Divergent
45mBuild better apps using CRDTs
48mSynchronizing Game Components
29mCRDT: Conflict-free Data Types for Collaborative Editing and Offline-First
32mCRDT and other new ideas for client-server communication
36mCRDT Architecture and Group Systems
38mAccidentally Concurrent