What does Concurrent Coupling and Blackboard Reuse conclude, in numbers, about “Eastern and Western Sources Examined: Sunzi on Division, the Analects on Harmony, Windowless Monads and Smith's Division of Labour”?
Answer: With seven nodes the full mesh has 21 channels; the best arrangement is 4 groups, which brings the count down to 9. With one thousand and twenty-four nodes the full mesh has 523,776 channels; split into 79 groups of 13, the structure needs only 9,210, more than fifty times fewer. Part B gives the approximate rule: the best group size is about \((2n)^{1/3}\), which comes to 5.0 for sixty-four nodes, 8.0 for two hundred and fifty-six, and 12.7 for one thousand and twenty-four, in agreement with the search.
Scope of the numbers: Parameters are illustrative, data are synthetic, and every figure is generated by the book's programs; the book is not individual business advice and promises no speed-up. Chapter 1 shows where the peak comes from, near 6.78 windows under illustrative parameters.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 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 |
Show the full program
# 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)))Single source and citation
Fan, Y. (2026). Topological Coupling of Concurrent Multi-Core Operations: Lock-Free Blackboard Signalling and Cross-Node Emergent Gains (Version 1.0.0), Chapter 7: Eastern and Western Sources Examined: Sunzi on Division, the Analects on Harmony, Windowless Monads and Smith's Division of Labour. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 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}
}Other chapter answers in this book
- Chapter 1 · Serial Fraction and Coherence Overhead: Why Throughput Has a Peak
- Chapter 2 · Fitting σ and κ from Throughput Records: Least Squares, Bootstrap Intervals and Design
- Chapter 3 · Exclusive-Create Locks: Conflict Rates, the Cost of Moving On, and Lost Updates
- Chapter 4 · The Append-Only Blackboard: Lock-Free Reads, Hash De-duplication and the Cost of Subscribing
- Chapter 5 · Coupling Topology and Search: Isolation, Ring, Small World and Full Connection on NK Landscapes
- Chapter 6 · Emergence as Measurable Reuse: Hypergraph Incidence and the Net Gain of Coupling
- Chapter 8 · Field Tools and Checker Specifications: the Concurrency Ledger, Four-Kit Clauses and a Pre-Registered Test