Latest Results
Add demand-driven coarse join scheduling
Introduce explicit global and worker-local spawning, local-first nested helping, private queues, and timed half-queue donation when workers stall. Cover the scheduler with deterministic tests and expose queue, donation, and stalled-time instrumentation.
For eligible cached top-index scans, preserve the physical shard partitioning and respond to idle workers by publishing bounded coarse batches to the global queue. Each batch executes its complete lower subtree serially for locality, and fixes its grain after the first demand signal to avoid geometric task proliferation.
In five-run paired graph-motif tests, this improves Q1 by 0.8%, 6.8%, and 8.7% at 8, 12, and 16 threads and Q2 by 2.4%, 6.6%, and 3.7%. CPU cost is effectively flat except for a 2.6% increase on Q2 at 12 threads, while scheduler idle time drops substantially.codex/demand-driven-join-scheduling Latest Branches
0%
0%
codex/packed-join-abstractions +5%
codex/demand-driven-join-scheduling © 2026 CodSpeed Technology