aboutsummaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Makefile: loops aligned in the batch executor alone (BATCH_OPTIMIZE): the lis...eunhhu11 days1-6/+8
* Makefile: the lists' and the batch executor's loops each start at a 64-byte l...eunhhu11 days1-1/+4
* Batch executor, stage 5 of design 025: decide finds a kept round's bit once (...eunhhu11 days1-18/+15
* Batch executor, stage 5 of design 025: the sums into cells at once from round...eunhhu11 days2-2/+145
* Design 025: stage 5's bars measured again on b16: BFS's candidate tail about ...eunhhu11 days1-2/+8
* Design 024: its header says stages 1-4 of 025 are made (134-137)eunhhu12 days1-1/+1
* Research 137: the batch executor's stage 4 (columns read in place, comparison...eunhhu12 days31-2/+333
* Batch executor, stage 4 of design 025: a four-byte comparison counts its 1s i...eunhhu12 days1-14/+28
* Design 025: stage 4's knapsack bar by arithmetic (8.6 ms: two 4 KB copies and...eunhhu12 days1-2/+5
* Batch executor, stage 4 of design 025: a column read at affine rows in memory...eunhhu12 days2-4/+86
* Research 136: the batch executor's stage 3 (four-byte MUL, reductions with no...eunhhu12 days31-2/+272
* Batch executor: a list's cells once a batch (cells_of, the first four lists i...eunhhu12 days1-11/+27
* check.py: REDUCE_SOURCE, reductions that start with no lanes (a count, unifor...eunhhu12 days1-0/+68
* 041 runs of b12 = d371271 (four-byte MUL) and b13 = 38f54ac (reductions with ...eunhhu12 days2-0/+120
* Batch executor, stage 3 of design 025: a reduction starts with no lanes: whil...eunhhu12 days1-8/+57
* Design 025: stage 3's matmul bar against what the four-byte MUL gave (26.57 m...eunhhu12 days1-2/+3
* Batch executor: select and deselect named select_arm and deselect_arm (POSIX'...eunhhu12 days1-6/+6
* Batch executor, stage 3 of design 025: four-byte MUL (words_op): a product be...eunhhu12 days1-1/+6
* Research 135: batch plans' stage 2 measured (b11 = 7959885 against b10, inter...eunhhu12 days5-2/+172
* Batch plans: stage 2's check let go (segments run as made); with it gone the ...eunhhu12 days1-38/+5
* Batch plans, stage 2 of design 025: segments, runs of a batch loop's instruct...eunhhu12 days1-5/+232
* Design 025: stage 2 reshaped after stage 1 (134): scalar segments planned at ...eunhhu12 days1-10/+22
* Research 134: batch plans' stage 1 measured (b10 = a6fabf0 against b9, interl...eunhhu12 days7-3/+227
* Batch plans: the check (PURE_BATCH_CHECK) let go, stage 1 made; with it gone ...eunhhu12 days1-122/+0
* Batch plans: the recurrences read once at load too (design 025, stage 1): the...eunhhu12 days1-98/+227
* Batch plans, stage 1 of design 025: each batch loop's block read once at load...eunhhu12 days4-30/+150
* 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
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 16:38:22 +0000