aboutsummaryrefslogtreecommitdiffstats
path: root/docs
Commit message (Expand)AuthorAgeFilesLines
...
* Design 024: a batch executor, loops run 256 rounds at a time by operations th...eunhhu2026-10-051-0/+136
* 125: forms and newton runs named; BFS's time after the graph's load is the ge...eunhhu2026-10-052-4/+6
* Research 125: the tier's first steps against C (e2e56dd: roots 1.40, knapsack...eunhhu2026-10-051-0/+80
* Pointer induction (023): an inner count's access by a key affine in its round...eunhhu2026-10-051-0/+8
* 040 forms.c: matmul's inner loop in the forms the tier may make it (index 20....eunhhu2026-10-051-0/+7
* The tier's numbers' arithmetic in a run, each read by the next alone (constan...eunhhu2026-10-051-2/+5
* A HASHED list's table four fifths full at most (100,000 keys in 1 MB of slots...eunhhu2026-10-051-2/+2
* Text keys (023): a list knows the text field it is keyed by; an event's list ...eunhhu2026-10-051-1/+8
* HASHED (023): an event's list keyed by numbers that came out of order keeps e...eunhhu2026-10-051-3/+6
* 023: near C is the aim (each within 1.25x, the geometric mean within 1.1x), n...eunhhu2026-10-051-10/+13
* Research 124: 022's BFS past C only by reading ahead (15.7 ms against 9.9 wit...eunhhu2026-10-051-0/+89
* 023: only checks the tier moved know just that they fail (those left in place...eunhhu2026-10-051-4/+8
* Design 023, before building it: a tier that lifts every block to SSA, knows t...eunhhu2026-10-051-0/+178
* Say what finishing 022's stage 3 found: the books and the work in registers, ...eunhhu2026-10-051-1/+40
* Say what 022 decided while building stages 1-4 and how stage 3 ends: integers...eunhhu2026-10-051-1/+36
* Design 022: stored lists as arrays with a bucket index fitted to the keys sea...eunhhu2026-10-051-0/+151
* Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f...eunhhu2026-10-052-1/+218
* Measure an index for a stored list's slices outside the list: three times a t...eunhhu2026-10-051-3/+8
* Say what a search's floor is with stored lists as trees: 373 ns a node to fin...eunhhu2026-10-051-1/+16
* Say how a search gets past C: event lists as arrays, a directory for stored k...eunhhu2026-10-051-0/+112
* The same answers on the final build and the same pure-runs on the Pi, WSL2 an...eunhhu2026-10-042-3/+8
* Check a pushed view that computes gets the newest value of writes made meanwh...eunhhu2026-10-041-0/+3
* Say 020 is built and measured (121, 122)eunhhu2026-10-041-1/+1
* Measure views off the connection threads: writes' tail as with the CPU shared...eunhhu2026-10-041-0/+84
* Measure computing faster: a search 2.1 times as fast, TPC-C 4.1%, four finger...eunhhu2026-10-041-0/+160
* Say why the dashboard's push-to-poll CPU sits at a tenth: an event costs what...eunhhu2026-10-041-0/+4
* Compute views with a body on view workers, off the connection threads, asked ...eunhhu2026-10-041-0/+11
* Keep one finger a thread, as before: four cost the bank's queries instruction...eunhhu2026-10-041-4/+6
* Search an event's keyed lists by a key set and lists by fingers, add by key i...eunhhu2026-10-041-1/+18
* Say where a search's time goes and how to make it and long views fast, with c...eunhhu2026-10-041-0/+84
* Wake each thread at most once a push, end streams only of stopped apps, and s...eunhhu2026-10-041-0/+15
* Say what pushing views costs and how fresh it keeps them (019, research 120)eunhhu2026-10-042-1/+92
* Push a view's value to its subscribers over SSE, once per group and interval ...eunhhu2026-10-042-1/+10
* Fix 019 before building: compare equal freshness, bound pushes per interval, ...eunhhu2026-10-041-9/+24
* Say how pure-serve pushes a view's value to its subscribers, and what it must...eunhhu2026-10-041-0/+91
* Say what views that compute cost the writes beside them (018 stage 3, researc...eunhhu2026-10-042-1/+84
* Say why stage 3's first isolation criterion could not hold, and what to measu...eunhhu2026-10-041-0/+21
* Let a view compute in its body, on a reader's own lists (018 stage 3)eunhhu2026-10-042-5/+16
* Say what computing in one event costs and finds (018 stage 2, research 118)eunhhu2026-10-042-1/+92
* Count in loops that nest, break, and keep an event's own lists, every event b...eunhhu2026-10-042-10/+30
* Say what a transient state saves a write (018 stage 1, research 117)eunhhu2026-10-042-1/+55
* Keep transient states the app's while it runs, never stored (018 stage 1)eunhhu2026-10-042-5/+13
* Say how aup chooses what a state outlives, and computes in memory (018)eunhhu2026-10-041-0/+199
* Say what an app's tokens cost (017 3b, research 116)eunhhu2026-10-042-1/+67
* Say how an app's routes take tokens, and what it must show (017, 3b)eunhhu2026-10-041-1/+30
* Say that reading the code found stage 3's two races, and how a host changes appseunhhu2026-10-042-4/+7
* Say what apps that change on a running host showed (017 stage 3, research 115)eunhhu2026-10-042-6/+139
* Say how apps start, stop and change on a running host, and what it must show ...eunhhu2026-10-041-1/+76
* Trade stores with the WSL2 too: its bytes are the Pi's (029, research 114)eunhhu2026-10-041-7/+6
* Say what running on an x86_64 WSL2 and an M3 Mac showed (research 114)eunhhu2026-10-021-0/+122
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 15:21:09 +0000