2. Flow consistency - read-your-writes consistency
2. Consistency, Availability and low Latency in Distributed system (workarounding the CAP/PACELC theorems) Introduction: " 1. Cache and Data Consistency in Distributed systems (CAP/PACELC/CRDT) " TL;DR Full strong Consistency in geographically Distributed systems can only be achieved by sacrificing Availability (per CAP theorem) and with prohibitive Latency costs (per PACELC theorem). However, we can still design consistent enough systems that continue to function when one geographical region is down and without paying the inter-region latency most of the time. While eventual Consistency is OK many times, there are still cases when we want a strong read-after-write consistency for certain read-after-write flows. There is an optimum design that assures strong Consistency inside read-after-writes flows . Arguably, this is the highest Consistency level that can be assured without a prohibitive impact on Availability and Latency.