关于「租约、时钟与围栏令牌」,《多窗口原子锁》给出的定量结论是什么?
结论:程序 p41 显示,同一个钟的跳变不会制造重叠,混用单调钟与墙钟才会:墙钟跳 5 秒造成 3.000 秒重叠,跳 3600 秒造成 58.000 秒重叠。程序 p42 显示,时钟完美时,60 秒租约留 2 秒余量仍有 0.000976 的写入迟到,几乎全部来自休眠。程序 p43 显示,迟到的 380 次写入在盲写下全部覆盖新数据,在存储端核对令牌时一次也不会。租约解决的是「主人死了怎么办」,可它对主人的死活作出的是一个基于时间的猜测。猜错的代价有多大?沉默多久才可以认定主人已死?下一章算这笔账。
数据口径:书中参数为示意;全部计算由书中程序生成;程序不读写任何文件;本书是非个人化经营建议,任何锁协议的上线变更与孤儿锁裁决须由主事者人工复核放行。 本书把协议的每一步写成原子操作,在内存里模拟文件系统,穷举全部交错调度,并修正蓝图四处:「必有」说的是调度空间,两窗口 16 种调度有 12 种双领,墙钟上的频率取决于出发是否扎堆,四个窗口 2 秒内一拥而上时每批 0.02966;迪杰斯特拉 1965 年恰恰证明只靠读写也能互斥,限制在于名册必须封闭;围栏令牌出自伯罗斯的序列号与克莱普曼的整理,不出自格雷与切里顿;单调计时挡不住进程停顿,时钟完美时仍有 0.000976 的写入迟到。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 3.000, 3600, 58.000, 60
| T = 60 s, margin m = 2 s | ||
| scenario | overlap(s) | margin need(s) |
| one wall clock, both read it, +5 s | 0.000 | 0.000 |
| one wall clock, both read it, -5 s | 0.000 | 0.000 |
| holder monotonic, healer wall +1 s | 0.000 | 1.000 |
| holder monotonic, healer wall +5 s | 3.000 | 5.000 |
| holder monotonic, healer wall +3600 s | 58.000 | 60.000 |
| two hosts, skew 0.5 s, 100 ppm | 0.000 | 0.488 |
| two hosts, skew 30 s | 28.000 | 30.000 |
| both monotonic, one host | 0.000 | 0.000 |
查看完整验算程序
# Chapter 4. p41: when a lease lets two windows act at once.
# A lease of T seconds is granted at real time 0. The holder stops at
# T - m on its own clock (m = safety margin); a healer takes over when
# its own clock says the lease has run out. Clocks have a rate error
# (ppm) and may be stepped (NTP correction, zone or sync-folder skew).
# Overlap = real seconds in which both may act. Values illustrative.
T, M = 60.0, 2.0
def overlap(h_rate, h_step, g_rate, g_step, same=False):
# 持有者在自身时钟读到 T - m 时停手;接管者读到 T 时动手
# 同一时钟:两者一起跳,持有者的读数与接管者同步
if same:
h_rate, h_step = g_rate, g_step
t_h = max(0.0, (T - M - h_step) / (1.0 + h_rate))
t_g = max(0.0, (T - g_step) / (1.0 + g_rate))
need = max(0.0, T - (1.0 + h_rate) * t_g - h_step)
return max(0.0, t_h - t_g), need
rows = (
("one wall clock, both read it, +5 s", 0, 0, 0, 5.0, True),
("one wall clock, both read it, -5 s", 0, 0, 0, -5.0, True),
("holder monotonic, healer wall +1 s", 0, 0, 0, 1.0, False),
("holder monotonic, healer wall +5 s", 0, 0, 0, 5.0, False),
("holder monotonic, healer wall +3600 s", 0, 0, 0, 3600.0, False),
("two hosts, skew 0.5 s, 100 ppm", 1e-4, 0, -1e-4, 0.5, False),
("two hosts, skew 30 s", 0, 0, 0, 30.0, False),
("both monotonic, one host", 0, 0, 0, 0.0, False),
)
print("T = %.0f s, margin m = %.0f s" % (T, M))
print("scenario overlap(s) margin need(s)")
for name, hr, hs, gr, gs, same in rows:
ov, need = overlap(hr, hs, gr, gs, same)
print("%-38s %9.3f %14.3f" % (name, ov, need))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《多窗口文件原子锁并发协议、断电孤儿锁自愈与跨窗口交接状态机母典》第 4 章「租约、时钟与围栏令牌」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-254 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026254,
author = {Fan, Yafu},
title = {Atomic File-Lock Protocols for Multiple Windows: Self-Recovering Orphan Locks after Power Loss and Cross-Window Hand-Over State Machines},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}