aboutsummaryrefslogtreecommitdiffstats
path: root/research
Commit message (Expand)AuthorAgeFilesLines
...
* Research 140: 2b's instruction counts: the workloads' modules the same, batch...eunhhu7 days3-0/+28
* Research 140, 027's stage 2b measured: JSON read into a tree (aup's examples/...eunhhu7 days3-0/+289
* Research 140: 2a's instruction counts: the workloads' modules the same, the e...eunhhu7 days4-0/+32
* Research 140, 027's stage 2a measured: whether bytes are JSON (aup's examples...eunhhu7 days3-0/+255
* Research 140: stage 1's instruction counts: the workloads' modules byte for b...eunhhu7 days2-0/+44
* Research 140, 027's stage 1 measured: SHA-256 written in aup (its examples/sh...eunhhu7 days4-0/+218
* Research 140: a suite of eleven specs from different fields (DNS, SHA-256, in...eunhhu7 days12-0/+74
* Batch executor: the round's fewest-left marks at the end of Batch: put after ...eunhhu9 days2-0/+60
* 043 programs (research 139, in progress): a batch loop's body as the program ...eunhhu11 days2-0/+405
* Research 138: the batch executor's stage 5, design 025 made: sums into cells ...eunhhu11 days30-0/+402
* Research 137: the batch executor's stage 4 (columns read in place, comparison...eunhhu12 days28-0/+262
* Research 136: the batch executor's stage 3 (four-byte MUL, reductions with no...eunhhu12 days28-0/+202
* 041 runs of b12 = d371271 (four-byte MUL) and b13 = 38f54ac (reductions with ...eunhhu12 days2-0/+120
* Research 135: batch plans' stage 2 measured (b11 = 7959885 against b10, inter...eunhhu12 days2-0/+100
* Research 134: batch plans' stage 1 measured (b10 = a6fabf0 against b9, interl...eunhhu12 days4-1/+152
* Design 025: batch programs (132's A), the block's facts once at load and only...eunhhu12 days2-1/+90
* 042 tiles: knapsack's two passes with the lanes numbered the batch executor's...eunhhu12 days2-3/+32
* 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 days2-0/+28
* 041 runs of b8 = d0558a3 and b9 = 33e9908 (the suite three ways and counts: b...eunhhu12 days4-0/+618
* 041 runs of b7 = 1f8faac (the suite three ways and counts: batches BFS 41.0 m...eunhhu12 days7-0/+549
* 041 runs of b5 = bdfc4d7 and b6 = de9efad: batches knapsack 10.84 ms (the com...eunhhu2026-10-067-54/+800
* Batch: a recurrence's steps each an operation of two numbers a round keeps (a...eunhhu2026-10-061-0/+11
* 041 runs of stages 4 and 5, sums into cells and walks (b3 = 06c2978, b4 = c67...eunhhu2026-10-0614-0/+853
* 041 runs of stage 2 (b2 = 76b4e3d): batches roots 9.13 ms (the compiled code ...eunhhu2026-10-053-0/+301
* 041 runs.sh: the suite three ways (the compiled code, the executor with batch...eunhhu2026-10-055-0/+384
* 041 join ops: the recurrence interpreted and each round's rest as 11 operatio...eunhhu2026-10-053-19/+172
* 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-051-0/+2
* Research 125: the tier's first steps against C (e2e56dd: roots 1.40, knapsack...eunhhu2026-10-052-0/+217
* The tier checks a number finite in integers (its exponent's bits all ones), o...eunhhu2026-10-052-0/+104
* 040 forms.c: matmul's inner loop in the forms the tier may make it (index 20....eunhhu2026-10-052-0/+93
* 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
* Research 124's floors: each workload by hand as Pure could run it (its lists'...eunhhu2026-10-055-186/+987
* Research 124's suite at 6b45806: Pure against C 3.3x (roots), 300x (knapsack)...eunhhu2026-10-052-0/+217
* Research 124's suite: seven kinds of work in one event each (roots, knapsack,...eunhhu2026-10-058-0/+568
* Read a slice's bucket and first cell some rounds ahead of the loop that opens...eunhhu2026-10-051-1/+6
* Design 022: stored lists as arrays with a bucket index fitted to the keys sea...eunhhu2026-10-056-7/+283
* Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f...eunhhu2026-10-0572-0/+1024
* Measure an index for a stored list's slices outside the list: three times a t...eunhhu2026-10-052-0/+113
* Say what a search's floor is with stored lists as trees: 373 ns a node to fin...eunhhu2026-10-053-0/+75
* The same answers on the final build and the same pure-runs on the Pi, WSL2 an...eunhhu2026-10-044-0/+145
* Measure views off the connection threads: writes' tail as with the CPU shared...eunhhu2026-10-049-3/+71
* Measure computing faster: a search 2.1 times as fast, TPC-C 4.1%, four finger...eunhhu2026-10-0466-0/+399
* The runs of research 122: writes beside views that compute, one asker and two...eunhhu2026-10-043-0/+283
* Wait for a counter before searching in bfs-run, and the runs of research 121eunhhu2026-10-042-0/+67
* Say where a search's time goes and how to make it and long views fast, with c...eunhhu2026-10-041-0/+83
* Wake each thread at most once a push, end streams only of stopped apps, and s...eunhhu2026-10-043-0/+93
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 11:34:31 +0000