Programming Distributed Systems
summary
Claims that small imperative-language tweaks provably eliminate common replica-consistency and concurrency bugs, implemented as the mixt language backed by an information‑flow type system, with a shim prototype of 15,000 lines of C++. Demonstrates monotonic programming that yields coordination‑free convergence and builds duratio 10× faster than Zookeeper, and a compile‑time scheme for banning destructive data races using an iso keyword that avoids runtime overhead.
AI-written summary · about
chapters (7)
- 0:00Start
- 1:45Building Programming Languages for Distributed Systems
- 11:07Composing consistency: populating rank
- 20:39Reliable Observations
- 23:02Programming monotonically
- 31:53Challenge: safely releasing locks
- 35:30Circular Doubly-Linked List
related talks
28mNew insights into distributed and concurrent programming
01h 30mImplementing, verifying and debugging distributed event-based systems
15mRethinking Safe Consistency in Distributed Object-Oriented Programming
42mDeclarative distributed concurrency in Scala
41mTowards language support for distributed systems
22mCompositional Programming and Testing of Dynamic Distributed Systems
43mMesh
01h 32mDistributed functional programming