aboutsummaryrefslogtreecommitdiffstats
path: root/docs/research/128-batch-executor-tables-and-costs.md
Commit message (Collapse)AuthorAgeFilesLines
* Research 128: the batch executor's appends, recurrences, sums into cells and ↵eunhhu2026-10-061-0/+147
walks (join 423 to 161 ms without machine code, the tier 74) and what a batch pays for, measured apart: an instruction about 20 ns a batch (0.02 ns a round at 1024 lanes), a reduction's end 4-9 ns a round, an append about 100 ns (the executor's), join's recurrence about 60 ns a round; BFS not batched (a count that grows, a filter that only grows, nested walks), so the JIT stays for now; the next in that order: appends at once, the recurrence's steps in registers, reductions' ends; 022 and 024 and CHECKPOINT say so