aboutsummaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Research 132 and 133 corrected: the per-batch cost was icount's three rounds ...eunhhu12 days2-10/+14
* Design 025: batch programs (132's A), the block's facts once at load and only...eunhhu12 days5-3/+271
* 042 tiles: knapsack's two passes with the lanes numbered the batch executor's...eunhhu12 days2-3/+32
* PURE_REUSE_KEPT a define: as an enum constant UINT32_MAX is past int, which c...eunhhu12 days1-1/+1
* Research 133: register tiles measured (132's deciding experiment): past the b...eunhhu12 days4-3/+91
* 042 tiles (research 133): a register-tile interpreter in two forms, computed ...eunhhu12 days3-0/+794
* Research 132 (no code): where the batch executor's cost sits (an element's pa...eunhhu12 days3-0/+194
* Research 131: the batch executor's general cuts, by the user's choice of the ...eunhhu12 days3-2/+97
* 041 runs of b8 = d0558a3 and b9 = 33e9908 (the suite three ways and counts: b...eunhhu12 days4-0/+618
* Batch: a selection's rows given back affine over the lanes around when they a...eunhhu12 days3-6/+27
* Batch: general cuts (docs/research/131). A value computed by the same code as...eunhhu12 days6-79/+636
* Research 130: the batch executor's frontiers (a count's guard, walks in a bat...eunhhu12 days3-2/+116
* 041 runs of b7 = 1f8faac (the suite three ways and counts: batches BFS 41.0 m...eunhhu12 days7-0/+549
* Batch: filters, if !L.has(k) { a line appending } in a batch's block or in a ...eunhhu2026-10-066-20/+517
* Batch: a count's loop whose block begins if slot >= L.count { break } (L only...eunhhu2026-10-064-28/+420
* Research 129: the batch executor's costs cut (appends at once 5.18 to 0.65 ms...eunhhu2026-10-063-2/+126
* 041 runs of b5 = bdfc4d7 and b6 = de9efad: batches knapsack 10.84 ms (the com...eunhhu2026-10-067-54/+800
* Batch: a round of the recurrences one loop of actions laid out once a batch (...eunhhu2026-10-061-34/+59
* Batch: reductions' ends in any order where the order cannot tell (the least a...eunhhu2026-10-061-1/+53
* Batch: a recurrence's steps each an operation of two numbers a round keeps (a...eunhhu2026-10-062-39/+71
* Batch: a batch's appends made at once (pure_list_add_many, a call a chunk of ...eunhhu2026-10-064-14/+351
* Research 128: the batch executor's appends, recurrences, sums into cells and ...eunhhu2026-10-064-2/+153
* 041 runs of stages 4 and 5, sums into cells and walks (b3 = 06c2978, b4 = c67...eunhhu2026-10-0614-0/+853
* Batch: a walk (EACH) whose block has batch forms runs a batch of its items at...eunhhu2026-10-063-30/+80
* Batch: a sum into a cell, L[k].f = L[k].f + e (k computed twice the same and ...eunhhu2026-10-062-15/+178
* Batch executor stage 5 (024): a recurrence (a local a round reads before it s...eunhhu2026-10-064-19/+287
* JIT: books written back only for lists their nest keeps books of: a nest with...eunhhu2026-10-061-0/+1
* Batch executor stage 4, first part (024): an item of numbers and bools append...eunhhu2026-10-064-21/+100
* JIT: an append to a HASHED list in a nest whose books keep DENSE appends' gro...eunhhu2026-10-062-10/+20
* 024, 126, 127: the lanes are 24 buffers (stage 2), about 200 KB a thread; sta...eunhhu2026-10-053-4/+7
* Research 127: the batch executor's stage 2 (nested loops' rounds run together...eunhhu2026-10-053-2/+67
* 041 runs of stage 2 (b2 = 76b4e3d): batches roots 9.13 ms (the compiled code ...eunhhu2026-10-053-0/+301
* Batch: numbers' results checked finite as they are made (in integers, in the ...eunhhu2026-10-051-39/+117
* Batch executor stage 2 (024): a loop in the batch's block runs its rounds for...eunhhu2026-10-054-47/+450
* Research 126: the batch executor's first stage (024) as built and measured: k...eunhhu2026-10-053-2/+105
* 041 runs.sh: the suite three ways (the compiled code, the executor with batch...eunhhu2026-10-055-0/+384
* Batch executor stage 1 (024): a count's loop whose block has batch forms (lan...eunhhu2026-10-058-64/+1316
* 024: the table with operations apart and interpreted beside the hand-fused fo...eunhhu2026-10-052-35/+37
* 041 join ops: the recurrence interpreted and each round's rest as 11 operatio...eunhhu2026-10-053-19/+172
* Design 024: a batch executor, loops run 256 rounds at a time by operations th...eunhhu2026-10-052-1/+137
* 041 knapsack u32_ops: the batch's operations apart and interpreted over four-...eunhhu2026-10-052-18/+70
* 041 batches: loops run a batch of rounds at a time, each operation a C loop m...eunhhu2026-10-054-0/+707
* 125: forms and newton runs named; BFS's time after the graph's load is the ge...eunhhu2026-10-053-4/+8
* Research 125: the tier's first steps against C (e2e56dd: roots 1.40, knapsack...eunhhu2026-10-054-1/+298
* The tier checks a number finite in integers (its exponent's bits all ones), o...eunhhu2026-10-053-4/+110
* Pointer induction (023): an inner count's access by a key affine in its round...eunhhu2026-10-053-9/+184
* 040 forms.c: matmul's inner loop in the forms the tier may make it (index 20....eunhhu2026-10-053-0/+100
* 040: the suite on 4bedd7f (11 rounds' medians, Pure / C): roots 1.58, knapsac...eunhhu2026-10-052-0/+217
* 040: TPC-C and the bank's queries against 6b45806 (023's criterion for the ap...eunhhu2026-10-0528-1/+136
* A text-keyed list let go at an event's end starts no key set (a number's bits...eunhhu2026-10-052-17/+20
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 13:49:26 +0000