
Picture Me Coding
Picture Me Coding is a music podcast about software. Each week your hosts Erik Aker and Mike Mull take on topics in the software world and they are sometimes joined by guests from other fields who arrive with their own burning questions about technology.
Email us at: podcast@picturemecoding.com
Patreon: https://patreon.com/PictureMeCoding
You can also pick up a Picture Me Coding shirt, mug, or stickers at our Threadless shop: https://picturemecoding.threadless.com/designs
Logo and artwork by Jon Whitmire - https://www.whitmirejon.com/
Picture Me Coding
The Story of the CAP Theorem Part 2
Mike and Erik return to the CAP Theorem to finish the discussion started last week. Their goal is to try to find answers to this question: why do software engineers love to talk about the CAP Theorem so much? This episode covers the 2002 Gilbert and Lynch proof of CAP, as well as more recent critiques of the CAP Theorem, mostly based on Martin Kleppeman's article “Please Stop Calling Databases CP OR AP”.
Links
- Brewer’s “Towards Robust Distributed Systems” (slideshow of the talk!)
- FLP Paper: Impossibility of Distributed Consensus with One Faulty Process (1985)
- Lynch: “A Hundred Impossibility Proofs for Distributed Computing” (1989)
- Lynch and Gilbert prove CAP Conjecture: “Brewer's conjecture and the feasibility of consistent, available, partition-tolerant web services” (2002)
- Martin Kleppeman “Please Stop Calling Databases CP OR AP”
- “Highly Available Transactions: Virtues and Limitations”