What does One Commander and the Serial Bottleneck conclude, in numbers, about “Batch Approval Windows: Harris's Square-Root Formula and the Price of Waiting”?

Answer: Chapter 4 uses Harris's square-root formula to find an optimal approval window of 58.55 minutes, lowering the serial share from 0.250 to 0.112.

Scope of the numbers: With illustrative parameters, cutting the serial share from a fifth to a twentieth raises the speedup by 3.325, while raising the agents from ten to a hundred adds only 1.236. Its parameters are illustrative; all calculations are generated by its programs.

中文版

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.112, 0.250, 58.55

on demand: 16 min per request, 96 min per hour, s = 0.250
shortest feasible window K / (1 - r lam) = 20.0 min
T minbatchcmd/hloads_effwaitcost
20.02.0060.01.0000.17230.069.00
30.03.0048.00.8000.14337.059.10
45.04.5040.00.6670.12247.554.25
58.65.8636.30.6050.11257.053.39
90.09.0032.00.5330.10079.055.70
120.012.0030.00.5000.094100.060.00
240.024.0027.00.4500.086184.082.20
Harris square root: T* = 58.55 min, cost 53.39

Key formula

\[W=\frac{T}{2}+K+r\left(\frac{\lambda T}{2}+1\right).\]
Show the full program
# Chapter 4. p41: The optimal approval window (an EOQ in disguise).
# Model: requests arrive at lam = 6 per hour (0.1 per minute). The
# commander opens an approval session every T minutes; each session
# costs a set-up K = 12 minutes (reloading context) plus r = 4 min
# per item. Commander minutes per hour: 60 K / T + 60 lam r.
# A request waits on average T/2 for the session, then K, then its
# place in the batch: W = T/2 + K + r (lam T / 2 + 1).
# Hourly cost = commander minutes + w x agent waiting minutes, with
# w = 0.05 (an agent's idle minute valued at a twentieth of the
# commander's). Setting dC/dT = 0 gives Harris's square root
# T* = sqrt(120 K / (w 60 lam (1 + r lam))). Agent work per item is
# 48 min. A session must fit in its window: T >= K / (1 - r lam).
# All parameters are illustrative.
import math

LAM, K, R, W, A = 0.1, 12.0, 4.0, 0.05, 48.0


def row(t):
    cmd = 60.0 * K / t + 60.0 * LAM * R
    wait = t / 2.0 + K + R * (LAM * t / 2.0 + 1.0)
    cost = cmd + W * 60.0 * LAM * wait
    per_item = R + K / (LAM * t)
    s = per_item / (per_item + A)
    return cmd, wait, cost, s


t_star = math.sqrt(120.0 * K / (W * 60.0 * LAM * (1.0 + R * LAM)))
print("on demand: %.0f min per request, %.0f min per hour, s = %.3f" % (
    K + R, 60.0 * LAM * (K + R), (K + R) / (K + R + A)))
print("shortest feasible window K / (1 - r lam) = %.1f min" % (
    K / (1.0 - R * LAM)))
print("%7s %7s %9s %6s %7s %8s %8s" % ("T min", "batch", "cmd/h",
                                     "load", "s_eff", "wait", "cost"))
for t in [20.0, 30.0, 45.0, t_star, 90.0, 120.0, 240.0]:
    cmd, wait, cost, s = row(t)
    print("%7.1f %7.2f %9.1f %6.3f %7.3f %8.1f %8.2f" % (
        t, LAM * t, cmd, cmd / 60.0, s, wait, cost))
print("Harris square root: T* = %.2f min, cost %.2f" % (
    t_star, row(t_star)[2]))

Single source and citation

Fan, Y. (2026). Constitutional Engineering for a One-Commander Silicon Empire: Serial Decision Bandwidth and Breaking Amdahl's Bottleneck (Version 1.0.0), Chapter 4: Batch Approval Windows: Harris's Square-Root Formula and the Price of Waiting. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-253 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026253,
  author    = {Fan, Yafu},
  title     = {Constitutional Engineering for a One-Commander Silicon Empire: Serial Decision Bandwidth and Breaking Amdahl's Bottleneck},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book