知识卡片
读锁等待更早写者
写请求等所有比自己更早的请求离开;读请求只需等更早写请求,所以同一段读可并发。等待对象是最近的更早写节点,唤醒后重新检查条件,不能因一个通知就直接获锁。节点以read/write前缀区分类别,真正排序依据顺序号,而非字符串字典序。
这张卡片看不懂?
这张卡片的反馈已满 10 条,暂时无法继续提交。
已有反馈 · 0 / 10 条
还没有人提交反馈。
在整书笔记中的位置
原书出处 · 1 处
- 分布式协调系统 · 查看原书依据
Write Lock 1: n = create(l + “/write-”, EPHEMERAL|SEQUENTIAL) 2 :C = getChildren(l, false) 3 :if n is lowest znode in C, exit 4 :p = znode in C ordered just before n 5 :if exists(p, true) wait for event 6 :goto 2 Read Lock 1: n = create(l + “/read-”, EPHEMERAL|SEQUENTIAL) 2 :C = getChildren(l, false) 3 :if no write znodes lower than n in C, exit 4 :p = write znode in C ordered just before n 5 :if exists(p, true) wait for event 6 :goto 3 Unlock 1: delete(n)
参考来源
- 位置:《大数据日知录:架构与算法》第5章《分布式协调系统》(来源项目:book-sources;源文件:extracted/大数据日知录_架构与算法/_epub-src/OEBPS/text00010.html)
- 结论依据:原文以“如果是读锁,其他读进程也可以获得锁”所在段落解释具体机制;本卡保留其条件,另将实现限制、勘误和教学推导在正文中明确区分。
- 原始内容:Write Lock 1: n = create(l + “/write-”, EPHEMERAL|SEQUENTIAL) 2 :C = getChildren(l, false) 3 :if n is lowest znode in C, exit 4 :p = znode in C ordered just before n 5 :if exists(p, true) wait for event 6 :goto 2 Read Lock 1: n = create(l + “/read-”, EPHEMERAL|SEQUENTIAL) 2 :C = getChildren(l, false) 3 :if no write znodes lower than n in C, exit 4 :p = write znode in C ordered just before n 5 :if exists(p, true) wait for event 6 :goto 3 Unlock 1: delete(n)
- 边界对照:[ZooKeeper编程指南](https://zookeeper.apache.org/doc/current/zookeeperProgrammers.html)、[ZooKeeper协调配方](https://zookeeper.apache.org/doc/current/recipes.html);用于校正原书简化,未将书外观点伪作原文。