关于「东西方原典考辨:孙子「分数」、论语「和而不同」、单子无窗与斯密分工」,《并发拓扑耦合与黑板复用》给出的定量结论是什么?
结论:七个节点时,全网状 21 条通道,最好分成 4 组,通道降到 9 条。一千零二十四个节点时,全网状 523,776 条,按每组 13 人分成 79 组,只需 9,210 条,少了五十多倍。B 段给出近似规律:最好的组规模约为 \((2n)^{1/3}\),六十四个节点时 5.0,二百五十六个时 8.0,一千零二十四个时 12.7,与搜索结果吻合。
数据口径:书中参数为示意,数据为合成,全部计算由书中程序生成;本书是非个人化经营建议,不提供任何加速比承诺。 第一章说明峰值从何而来,示意参数下峰值在 6.78 个窗口附近。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 12.7, 13, 21, 5.0, 523776, 79
| A. channels: full mesh vs best two-level partition | |
| n mesh best g groups channels per node | |
| 7 | 21 2 4 9 1.29 |
| 16 | 120 3 6 30 1.88 |
| 64 | 2,016 5 13 204 3.19 |
| 256 | 32,640 8 32 1,392 5.44 |
| 1,024 | 523,776 13 79 9,210 8.99 |
| B. cube-root rule: best g near (2n)^(1/3) | |
| n | 64: (2n)^(1/3) = 5.0 |
| n | 256: (2n)^(1/3) = 8.0 |
| n | 1,024: (2n)^(1/3) = 12.7 |
查看完整验算程序
# Chapter 7. p71: Sunzi's fenshu as a channel count under partition.
# "Governing many like governing few is a matter of division and
# numbers." Model: n nodes in G = ceil(n / g) groups of size g, full
# mesh inside each group, one lead per group, full mesh among leads.
# Channels = sum over groups of g_i (g_i - 1) / 2 + G (G - 1) / 2.
# The best g is found by search; compared with the full mesh. The
# smooth approximation n (g - 1) / 2 + (n / g)^2 / 2 is least at
# g = (2n)^(1/3).
import math
def channels(n, g):
groups = math.ceil(n / g)
total = 0
left = n
for _ in range(groups):
size = min(g, left)
total += size * (size - 1) // 2
left -= size
return total + groups * (groups - 1) // 2
if __name__ == "__main__":
print("A. channels: full mesh vs best two-level partition")
print(" n mesh best g groups channels per node")
for n in (7, 16, 64, 256, 1024):
best = min(range(1, n + 1), key=lambda g: (channels(n, g), g))
c = channels(n, best)
print(" {:>7,} {:>10,} {:>7} {:>6} {:>8,} {:>8.2f}".format(
n, n * (n - 1) // 2, best, math.ceil(n / best), c, c / n))
print("B. cube-root rule: best g near (2n)^(1/3)")
for n in (64, 256, 1024):
print(" n = {:>5,}: (2n)^(1/3) = {:.1f}".format(
n, (2.0 * n) ** (1.0 / 3.0)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《多核并发操作拓扑耦合、共享黑板无锁通信与跨节点涌现增益母典》第 7 章「东西方原典考辨:孙子「分数」、论语「和而不同」、单子无窗与斯密分工」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-411 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026411,
author = {Fan, Yafu},
title = {Topological Coupling of Concurrent Multi-Core Operations: Lock-Free Blackboard Signalling and Cross-Node Emergent Gains},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}