ConceptSystems & CS
CAL theorem
A generalization of Brewer's CAP theorem that quantifies the trade-off between consistency, availability, and latency in distributed systems.
Know first
Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.
Lecturers
1Connections
3The lectures that define it or assume it, and the concepts next to it.