此卡片不在当前主题的阅读序列中,可返回主题继续阅读。
知识卡片
分区时选择服务保证
CAP讨论网络分区时,能否同时满足线性一致性与每个正常节点请求均得到有效响应。对不容许超卖的扣减操作,可以拒绝部分请求;对商品展示,可接受短暂旧值。不能用“电商优先可用”替代逐操作的业务判断。
这张卡片看不懂?
这张卡片已通过人工审查,不再接受失败反馈。
已有反馈 · 0 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- Consistency and Availability · 查看原书依据
The CAP theorem, proposed by Eric Brewer, is a fundamental principle that highlights the trade-offs between consistency and availability in distributed systems. It states that in the presence of network partitions (P), a distributed system can only guarantee either strong consistency (C) or availability (A), but not both simultaneously.
参考来源
- 位置:《Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…》第04章《Consistency and Availability》(来源项目book-sources;源文件:extracted/Building Distributed Systems Designing scalable architectures with microservices, event-driven patterns, and robust deployment…/_epub-src/OPS/ch04.xhtml)
- 结论依据:原文的机制或对比支持以下核心判断:CAP讨论网络分区时,能否同时满足线性一致性与每个正常节点请求均得到有效响应。 本卡将相邻说明中的适用限制保留为解释。
- 原始内容:The CAP theorem, proposed by Eric Brewer, is a fundamental principle that highlights the trade-offs between consistency and availability in distributed systems. It states that in the presence of network partitions (P), a distributed system can only guarantee either strong consistency (C) or availability (A), but not both simultaneously.