What does Bottleneck Triage and Value-per-Hour Scheduling conclude, in numbers, about “Frustum Culling: Tasks with No Causal Path to Cash”?

Answer: With no misreading at all, culling raises the day's value from 110.7 points to 219.1, an increase of 0.979, nearly double. With a misreading rate of 0.1 the increase is 0.846; at 0.3 it is still 0.548; even at 0.5, when every other task is misread, culling still adds 0.200. The price appears in the last column: the value left sitting in the parked pile rises with the misreading rate, from 17.8 points to 155.7.

Scope of the numbers: Smith proved in 1956 that when one person faces a list, the order that minimises the weighted cost of delay sorts tasks by value divided by duration, not by value; on seven illustrative tasks the importance order pays 0.311 more than the exhaustive optimum. Frustum culling and levels of detail from computer graphics show that a fixed frame budget should not be spent on doing everything finely: doing all eight illustrative tasks finely finishes only three and reaches 0.783 of the best plan.

中文版

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.1, 0.200, 0.3, 0.5, 0.548, 0.846

elistcullgainvalue left in the cull pile
0.0110.7219.10.97917.8
0.1110.7204.30.84645.8
0.2110.7188.80.70673.0
0.3110.7171.40.548100.5
0.5110.7132.80.200155.7
Show the full program
# Chapter 4. p42: what culling costs when the task graph is misjudged.
# Each simulated day has 12 candidate tasks of 20 to 120 minutes and a
# focus budget of 300 minutes. True class: IN with prob 0.25 (value 1.0
# per minute), DEFER 0.40 (0.25 per minute), CULL 0.35 (0, except that
# one in ten hides an unseen path worth 0.6 per minute).
# The operator misreads each task with prob e: an IN or DEFER task is
# culled, or a CULL task is kept as DEFER. Policies:
#   list     work the list in random order until the budget is spent
#   cull     IN first, then DEFER, never CULL (by the operator's labels)
# 10,000 days per row, common random numbers. Illustrative values.
import math
import random
import statistics

RATE = {"IN": 1.0, "DEFER": 0.25, "CULL": 0.0}


def make_day(rng):
    day = []
    for _ in range(12):
        m = rng.choice(range(20, 121, 10))
        u = rng.random()
        c = "IN" if u < 0.25 else ("DEFER" if u < 0.65 else "CULL")
        hidden = c == "CULL" and rng.random() < 0.1
        day.append((m, c, 0.6 if hidden else RATE[c]))
    return day


def spend(order, budget=300):
    left, val = budget, []
    for m, rate in order:
        use = min(m, left)
        val.append(use * rate)
        left -= use
        if left <= 0:
            break
    return math.fsum(val)


print("e     list    cull    gain    value left in the cull pile")
for e in (0.0, 0.1, 0.2, 0.3, 0.5):
    rng = random.Random(37642)
    a, b, lost = [], [], []
    for _ in range(10000):
        day = make_day(rng)
        shuffled = day[:]
        rng.shuffle(shuffled)
        a.append(spend([(m, r) for m, _, r in shuffled]))
        lab = []
        for m, c, r in day:
            if rng.random() < e:
                c2 = "CULL" if c != "CULL" else "DEFER"
            else:
                c2 = c
            lab.append((m, c2, r))
        ins = [(m, r) for m, c2, r in lab if c2 == "IN"]
        dfr = [(m, r) for m, c2, r in lab if c2 == "DEFER"]
        b.append(spend(ins + dfr))
        lost.append(math.fsum(m * r for m, c2, r in lab if c2 == "CULL"))
    ma, mb = statistics.fmean(a), statistics.fmean(b)
    print("%.1f  %6.1f  %6.1f  %6.3f  %6.1f" % (
        e, ma, mb, mb / ma - 1.0, statistics.fmean(lost)))

Single source and citation

Fan, Y. (2026). Stage-Bottleneck Triage, Weighted Shortest-Processing-Time Scheduling and Level-of-Detail Execution Velocity (Version 1.0.0), Chapter 4: Frustum Culling: Tasks with No Causal Path to Cash. 5D Library. DOI pending

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

BibTeX
@book{fan2026376,
  author    = {Fan, Yafu},
  title     = {Stage-Bottleneck Triage, Weighted Shortest-Processing-Time Scheduling and Level-of-Detail Execution Velocity},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book