What does Concurrent Coupling and Blackboard Reuse conclude, in numbers, about “Fitting σ and κ from Throughput Records: Least Squares, Bootstrap Intervals and Design”?
Answer: 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.
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: 0.962, 6.37, 7.80
| A. 2,000 bootstrap refits, 0 without a finite peak | |
| quantity | 5 % 50 % 95 % |
| sigma | 0.0627 0.1034 0.1483 |
| kappa | 0.0141 0.0189 0.0229 |
| N* | 6.37 6.89 7.80 |
| peak X | 29.44 30.10 30.82 |
| B. share of refits with N* below N | 6: 0.000 |
| B. share of refits with N* below N | 8: 0.962 |
| B. share of refits with N* below N | 10: 1.000 |
| C. integer band for N* | 6 to 8 |
Show the full program
# Chapter 2. p22: bootstrap intervals for sigma, kappa, N* and the peak.
# Same synthetic data as p21 (seed 41121). Resample observations with
# replacement inside each level N (stratified pairs bootstrap, Efron),
# refit, and read 5 % and 95 % percentiles. B = 2000 resamples.
import math
import random
TRUE_S, TRUE_K, X1 = 0.08, 0.02, 10.0
LEVELS = (1, 2, 3, 4, 6, 8, 10, 12)
REPS = 3
B = 2000
def usl(n, s, k):
return n / (1.0 + s * (n - 1) + k * n * (n - 1))
def observe(rng):
data = []
for n in LEVELS:
for _ in range(REPS):
noise = math.exp(rng.gauss(0.0, 0.06))
data.append((n, X1 * usl(n, TRUE_S, TRUE_K) * noise))
return data
def fit(data):
base = [x for n, x in data if n == 1]
x1 = math.fsum(base) / len(base)
rows = [(n - 1, n * (n - 1), n / (x / x1) - 1.0)
for n, x in data if n > 1]
a = math.fsum(r[0] * r[0] for r in rows)
b = math.fsum(r[0] * r[1] for r in rows)
d = math.fsum(r[1] * r[1] for r in rows)
e = math.fsum(r[0] * r[2] for r in rows)
f = math.fsum(r[1] * r[2] for r in rows)
det = a * d - b * b
return x1, (e * d - b * f) / det, (a * f - b * e) / det
def pct(xs, q):
ys = sorted(xs)
return ys[min(len(ys) - 1, int(q * len(ys)))]
if __name__ == "__main__":
data = observe(random.Random(41121))
groups = {n: [d for d in data if d[0] == n] for n in LEVELS}
rng = random.Random(41122)
ss, ks, ns, ps = [], [], [], []
no_peak = 0
for _ in range(B):
boot = []
for n in LEVELS:
g = groups[n]
boot += [g[rng.randrange(len(g))] for _ in g]
x1, s, k = fit(boot)
ss.append(s)
ks.append(k)
if k <= 0.0 or s >= 1.0:
no_peak += 1
continue
nstar = math.sqrt((1.0 - s) / k)
ns.append(nstar)
ps.append(x1 * usl(nstar, s, k))
print("A. {:,} bootstrap refits, {} without a finite peak".format(
B, no_peak))
print(" quantity 5 % 50 % 95 %")
for name, xs, fmt in (("sigma", ss, "{:8.4f}"),
("kappa", ks, "{:8.4f}"),
("N*", ns, "{:8.2f}"),
("peak X", ps, "{:8.2f}")):
print(" {:<9} ".format(name) + " ".join(
fmt.format(pct(xs, q)) for q in (0.05, 0.5, 0.95)))
for cur in (6, 8, 10):
past = 0
for v in ns:
if v < cur:
past += 1
print("B. share of refits with N* below N = {:>2}: {:.3f}".format(
cur, past / len(ns)))
lo, hi = pct(ns, 0.05), pct(ns, 0.95)
print("C. integer band for N*: {} to {}".format(
math.floor(lo), math.ceil(hi)))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 2: Fitting σ and κ from Throughput Records: Least Squares, Bootstrap Intervals and Design. 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 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 7 · Eastern and Western Sources Examined: Sunzi on Division, the Analects on Harmony, Windowless Monads and Smith's Division of Labour
- Chapter 8 · Field Tools and Checker Specifications: the Concurrency Ledger, Four-Kit Clauses and a Pre-Registered Test