What does Team Size under Coordination Overhead conclude, in numbers, about “Serial Fractions and Pairwise Coherence: Amdahl's Ceiling and the Optimal Size under the Universal Scalability Law”?
Answer: The first line has no coherence cost, only contention of 0.05; capacity rises monotonically towards 20.0 and has no peak. From the second line on, the coherence term b is positive and capacity peaks somewhere. With contention 0.05 and coherence 0.002 the peak lies at 21.79 members, the best integer is 22 and peak capacity is 7.40; doubling to forty-four members lowers capacity to 6.35. With coherence raised to 0.01 the peak moves down to 9.75 members and peak capacity to 4.26. With contention 0.10 and coherence 0.03 the peak lies at 5.48, so six members, with peak capacity 2.50 and efficiency per member 0.417; doubling to twelve lowers capacity to 1.98. With contention 0.20 and coherence 0.05 the peak is at exactly 4.00, and four members together are worth only 1.82 solo members.
Scope of the numbers: Parameters are illustrative; all calculations are generated by the book's programs; the book is general business analysis, not individualised business advice. Chapter 4 takes this bureau's four volumes in parallel per wave as an illustrative scene: capacity peaks at 6.78 windows, four windows already reach 89.6 % of the peak, and the coordinator's review queue holds the ceiling at four.
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.002, 0.01, 0.05, 0.10, 0.20, 0.417
| a b n*_real n*_int C(n*) C(2n*) eff(n*) | |
| 0.05 | 0.000 inf - no peak; C -> 20.0 |
| 0.05 | 0.002 21.79 22 7.40 6.35 0.336 |
| 0.05 | 0.010 9.75 10 4.26 3.48 0.426 |
| 0.10 | 0.010 9.49 10 3.57 2.99 0.357 |
| 0.10 | 0.030 5.48 6 2.50 1.98 0.417 |
| 0.20 | 0.050 4.00 4 1.82 1.54 0.455 |
| a | 0.10, b = 0.01: C(n) for n = 1 to 16 |
| 1.00 1.79 2.38 2.82 3.13 3.33 3.47 3.54 | |
| 3.57 3.57 3.55 3.51 3.46 3.40 3.33 3.27 |
Show the full program
# Chapter 3. p32: contention plus pairwise coherence: the optimum size.
# Universal scalability law (Gunther 2007): relative capacity
# C(n) = n / (1 + a (n - 1) + b n (n - 1)). a is contention (Amdahl's
# serial share); b is the cost of keeping each pair consistent, the term
# that grows with Brooks's n(n-1)/2. With b > 0, C(n) peaks at
# n* = sqrt((1 - a) / b) and then falls. Parameters are illustrative.
import math
def cap(n, a, b):
return n / (1.0 + a * (n - 1) + b * n * (n - 1))
if __name__ == "__main__":
print(" a b n*_real n*_int C(n*) C(2n*) eff(n*)")
for a, b in ((0.05, 0.0), (0.05, 0.002), (0.05, 0.01),
(0.10, 0.01), (0.10, 0.03), (0.20, 0.05)):
if b == 0.0:
print(" {:4.2f} {:6.3f} inf - no peak; C -> {:.1f}"
.format(a, b, 1.0 / a))
continue
nr = math.sqrt((1.0 - a) / b)
ni = max((cap(n, a, b), n) for n in range(1, 200))[1]
print(" {:4.2f} {:6.3f} {:8.2f} {:6d} {:5.2f} {:7.2f} {:7.3f}"
.format(a, b, nr, ni, cap(ni, a, b), cap(2 * ni, a, b),
cap(ni, a, b) / ni))
a, b = 0.10, 0.01
print("a = 0.10, b = 0.01: C(n) for n = 1 to 16")
vals = ["{:.2f}".format(cap(n, a, b)) for n in range(1, 17)]
print(" " + " ".join(vals[:8]))
print(" " + " ".join(vals[8:]))Single source and citation
Fan, Y. (2026). The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead (Version 1.0.0), Chapter 3: Serial Fractions and Pairwise Coherence: Amdahl's Ceiling and the Optimal Size under the Universal Scalability Law. 5D Library. DOI pending
DOI pending · monograph page goes live after publication · 5DL-B-322 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026322,
author = {Fan, Yafu},
title = {The Ringelmann Effect and Brooks's Law: the Optimal Size of Teams and Agent Squads under Coordination Overhead},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}Other chapter answers in this book
- Chapter 1 · Ringelmann's Two Sets of Numbers: Where "Half at Eight" Comes From and What the Rope Experiment Says
- Chapter 2 · Brooks's Law: n(n-1)/2 Channels and the Newcomers on a Late Project
- Chapter 4 · The Parallel Ceiling of an Agent Squad: How Many Volumes per Wave Pay Best
- Chapter 5 · Merge Conflicts as a Birthday Problem: Shared Files, Hot Files and Private Directories
- Chapter 6 · Work Tables and the Pruning of Channels: Mesh, Star, Cells and Longest Job First
- Chapter 7 · Classical Sources East and West: "Working in Common Is Slow" in the Lüshi Chunqiu and Ringelmann in 1913
- Chapter 8 · Closing the Loop: Agent Squad Ceilings, Work Tables and a Pre-Registered Test