← 返回卡片

原书出处

大数据日知录_架构与算法

05 分布式协调系统

2014年9月第1版 · 核验版本的摘录快照 · 导入于 2026-10-24T04:14:12.120Z

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)

此预览只包含定位所需的摘录和上下文。

原书定位详情

来源:a19c7933-4eda-4176-aebd-30fe7e1ad292

正文位置:extracted/大数据日知录_架构与算法/_epub-src/OEBPS/text00010.html

EPUB SHA-256:e45b74c4bdd8959aef24f2a5183280eb73ec5f173108f8679a4bbf44bbd5b34d