知识卡片
分区下的一致性取舍
网络分区使节点无法及时互通时,若必须继续给每次请求返回成功,就无法同时承诺所有操作遵循同一个线性化顺序;若守住该强一致性,某些请求就要等待或失败。CAP是特定通信与一致性模型中的不可能性,不是日常任取三项中的两项,也不是优化任意指标都等同CAP。正常网络条件下的一致性与延迟取舍仍需另行分析。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- Chapter 2. Important Distributed System Concepts · 查看原书依据
The trade-offs above between consistency, availability, and partition tolerance is known as the CAP theorem, and it states that you can build a system with two of the three attributes, e.g., a system that is consistent and available but not partition tolerant, but you can’t build
参考来源
- 位置:《Designing Distributed Systems, 2nd Edition》第02章《Chapter 2. Important Distributed System Concepts》(来源项目 book-sources;源文件:extracted/Designing Distributed Systems, 2nd Edition/_epub-src/OEBPS/ch02.html)
- 结论依据:原文引出CAP,卡片依据Gilbert与Lynch原始论文限定到异步网络分区、原子一致性与可用性,不沿用泛化二选三措辞。
- 原始内容:The trade-offs above between consistency, availability, and partition tolerance is known as the CAP theorem, and it states that you can build a system with two of the three attributes, e.g., a system that is consistent and available but not partition tolerant, but you can’t build