知识卡片

普通读书笔记卡 · 5390.a

仲裁与独占锁限制双活

理解等级:高级

处理网络分区可让获得严格多数的分区继续服务,其余停止,利用两个互斥集合不能同时各占严格多数。两节点也可借共享数据库独占锁裁决谁继续,但数据库成为必须单独保护的依赖。书中使用奇数多副本方案,核心是多数裁决及访问权限,不应把奇数概括为所有quorum协议的数学必要条件;锁方案也不能凭超时替代独占性保证。

这张卡片看不懂?

已有反馈 · 0 / 10 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • 构建稳定系统 · 查看原书依据

      With two nodes, we can approximate a solution with each node getting a database lock, allowing whatever partition that includes the database to continue. However, with this technique, the system fails if the database fails, which is a single point of failure that needs to be handled separately.

    参考来源

    - 位置:《Software Architecture and Decision-Making》第12章《Building Stable Systems》(来源项目:book-sources;源文件:extracted/Software Architecture and Decision-Making Leveraging Leadership, Technology, and Product Management to Build Great Products… (Srinath Perera)/_epub-src/ch12.xhtml) - 结论依据:摘录说明处理网络分区可让获得严格多数的分区继续服务,其余停止,利用两个互斥集合不能同时各占严格多数。其余条件结合本章相邻例子与取舍说明,数字示例不作当前性能承诺。 - 原始内容:With two nodes, we can approximate a solution with each node getting a database lock, allowing whatever partition that includes the database to continue. However, with this technique, the system fails if the database fails, which is a single point of failure that needs to be handled separately.