Topological Coupling of Concurrent Multi-Core Operations: Lock-Free Blackboard Signalling and Cross-Node Emergent Gains: chapter answers
Two beliefs circulate wherever work runs in parallel windows: the more windows, the faster; and every node should talk to every other. This book refutes the half of each that is repeated as a law. Concurrent throughput is bounded jointly by the serial fraction and by coherence overhead, so under Gunther's universal scalability law it has a peak, beyond which extra nodes slow the whole down; coupling between nodes has an optimum, and neither full isolation nor full connection is it; and "lock-free", "conflict-free" and "emergent" are rewritten as quantities that can be measured, given interval…
DOI pending · monograph page goes live after publication · 5DL-B-411 · 中文版
- Chapter 1 · Serial Fraction and Coherence Overhead: Why Throughput Has a Peak
Chapter 1 shows where the peak comes from, near 6.78 windows under illustrative parameters. - Chapter 2 · Fitting σ and κ from Throughput Records: Least Squares, Bootstrap Intervals and Design
Chapter 2 fits σ and κ by linearised least squares; a stratified bootstrap gives a peak interval from 6.37 to 7.80 and shows that 0.962 of resamples put eight windows past the peak. - Chapter 3 · Exclusive-Create Locks: Conflict Rates, the Cost of Moving On, and Lost Updates
Chapter 3 simulates exclusive-create locks in memory: overwriting loses 0.907 of updates with sixteen writers, exclusive creation never lets two windows hold one number, and ordered requests or single holding rule out d… - Chapter 4 · The Append-Only Blackboard: Lock-Free Reads, Hash De-duplication and the Cost of Subscribing
Chapter 4 explains why an append-only board needs no lock on the read path, with a best subscription share near 0.7 under illustrative parameters. - Chapter 5 · Coupling Topology and Search: Isolation, Ring, Small World and Full Connection on NK Landscapes
Chapter 5 compares four topologies on NK landscapes: full connection starts fastest, but by round 80 the ring reaches 0.9280 against 0.9150; semi-isolated subgroups peak at 0.9259 with moderate cross-group links. - Chapter 6 · Emergence as Measurable Reuse: Hypergraph Incidence and the Net Gain of Coupling
Chapter 6 writes emergence as cross-node reuse and a net-gain interval on a hypergraph incidence matrix; a reading lag of one day removes 0.944 of the repeated pitfalls seen under isolation. - Chapter 7 · Eastern and Western Sources Examined: Sunzi on Division, the Analects on Harmony, Windowless Monads and Smith's Division of Labour
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,… - Chapter 8 · Field Tools and Checker Specifications: the Concurrency Ledger, Four-Kit Clauses and a Pre-Registered Test
Chapter 8 gives the Concurrency Coupling and Blackboard Reuse Calculator, a checker table, the ledger rhythm and a pre-registered test needing 156 records per arm. Marked boxes separate published evidence, runnable Pyth…
Illustrative model calculation, not a live quote