原书出处
大数据日知录_架构与算法
05 分布式协调系统
Lock 1: n = create(l + “/lock-”, 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 watch event 6 :goto 2 Unlock 1: delete(n)
原书定位详情
来源:a19c7933-4eda-4176-aebd-30fe7e1ad292
正文位置:extracted/大数据日知录_架构与算法/_epub-src/OEBPS/text00010.html
EPUB SHA-256:e45b74c4bdd8959aef24f2a5183280eb73ec5f173108f8679a4bbf44bbd5b34d