Coordination-Free Computations
summary
A prototype language/runtime called Lasp composes CRDTs so distributed programs converge without consensus by carrying CRDT metadata through maps, filters and joins; implementation uses Erlang, Riak Core CRDT library, LevelDB/Bitcask/ETS and QuickCheck-based tests. It enforces monotonic read with causal context, supports an ad counter example that disables ads at 50,000 impressions, and demonstrates materialized-view and IoT edge deployments. Core claims: coordination-free composition of mergeable data types yields strong eventual convergence; some optimizations (OSWAT tombstone reduction) remain engineering work.
AI-written summary · about
chapters (5)
related talks
01h 01mLogic and Algebras for Distributed Computing: Applications and Open Questions
22mHappily Ever After: A CRDT Fairy Tale
35mData Types for Eventually Consistent Databases
29mHow to Read the Exact Time When You Have a Billion Clocks
50mCRDTs in Practice
41mConsistency without consensus in production systems
17mJust-Right Consistency
52mI See What You Mean