aboutsummaryrefslogtreecommitdiffstats
Commit message (Expand)AuthorAgeFilesLines
* Read ahead in integers in the integers' code, and the bucket's last cell as w...eunhhu2026-10-051-12/+103
* Keep the work an event may still do in a register, x30 among what is kept, sm...eunhhu2026-10-052-64/+175
* Keep a nest's books in registers: a FLAT list's count and a DENSE one's items...eunhhu2026-10-051-44/+265
* Compile each nest of loops twice, the second with whole numbers as integers (...eunhhu2026-10-054-75/+472
* Compile only blocks whose loops are code throughout: a loop of steps (TPC-C's...eunhhu2026-10-051-9/+39
* Say what 022 decided while building stages 1-4 and how stage 3 ends: integers...eunhhu2026-10-051-1/+36
* Read a slice's bucket and first cell some rounds ahead of the loop that opens...eunhhu2026-10-054-8/+353
* Keep arrays' number columns as narrow as their values (u8, u32, f64; a DENSE ...eunhhu2026-10-055-204/+735
* Compile with the stack's values in registers, comparisons and bits branched o...eunhhu2026-10-053-339/+1141
* Pack a stored keyed list searched often into arrays and a bucket index fitted...eunhhu2026-10-054-34/+546
* Design 022: stored lists as arrays with a bucket index fitted to the keys sea...eunhhu2026-10-057-7/+434
* Measure 021: BFS 190 to 90 ms over HTTP against C's 9.1, short of C; Pure's f...eunhhu2026-10-0575-2/+1243
* Compile only blocks with a loop, keep no code for a module without one, set a...eunhhu2026-10-052-11/+36
* Measure an index for a stored list's slices outside the list: three times a t...eunhhu2026-10-053-3/+121
* Say what a search's floor is with stored lists as trees: 373 ns a node to fin...eunhhu2026-10-054-1/+91
* Read a tree's items in compiled code from a run the frame keeps, start a run ...eunhhu2026-10-055-8/+88
* Write the hot instructions as code: constants, states, locals, rows, arithmet...eunhhu2026-10-054-27/+424
* Run a block through a frame and step, and compile blocks to AArch64 that call...eunhhu2026-10-056-558/+1159
* Share an event's empty list as it is: a snapshot made every event's lists tre...eunhhu2026-10-052-1/+20
* Keep an event's lists in arrays, flat or at their keys, and read a field by k...eunhhu2026-10-055-18/+620
* 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-046-3/+153
* Check a pushed view that computes gets the newest value of writes made meanwh...eunhhu2026-10-042-9/+44
* 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-0411-6/+158
* Measure computing faster: a search 2.1 times as fast, TPC-C 4.1%, four finger...eunhhu2026-10-0467-0/+559
* Say why the dashboard's push-to-poll CPU sits at a tenth: an event costs what...eunhhu2026-10-041-0/+4
* The runs of research 122: writes beside views that compute, one asker and two...eunhhu2026-10-043-0/+283
* Compute views with a body on view workers, off the connection threads, asked ...eunhhu2026-10-043-81/+393
* End a loop's iteration at the block's end check, not a second one per instruc...eunhhu2026-10-041-12/+12
* Keep one finger a thread, as before: four cost the bank's queries instruction...eunhhu2026-10-043-37/+28
* Wait for a counter before searching in bfs-run, and the runs of research 121eunhhu2026-10-042-0/+67
* Search an event's keyed lists by a key set and lists by fingers, add by key i...eunhhu2026-10-047-97/+762
* Say where a search's time goes and how to make it and long views fast, with c...eunhhu2026-10-042-0/+167
* Wake each thread at most once a push, end streams only of stopped apps, and s...eunhhu2026-10-046-4/+130
* Say what pushing views costs and how fresh it keeps them (019, research 120)eunhhu2026-10-0454-1/+458
* Watch a subscriber for writing only while it keeps output, and measure freshn...eunhhu2026-10-043-2/+247
* Push a view's value to its subscribers over SSE, once per group and interval ...eunhhu2026-10-044-6/+613
* 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
* Put lifetimes and computing in the checkpoint (018)eunhhu2026-10-041-1/+2
* Say what views that compute cost the writes beside them (018 stage 3, researc...eunhhu2026-10-048-1/+383
* 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-047-35/+292
* Say what computing in one event costs and finds (018 stage 2, research 118)eunhhu2026-10-045-4/+187
* Measure 018 stage 2: a graph search in one event, the pairs, and runs to comp...eunhhu2026-10-0434-0/+511
* Count in loops that nest, break, and keep an event's own lists, every event b...eunhhu2026-10-049-54/+422
* Say what a transient state saves a write (018 stage 1, research 117)eunhhu2026-10-045-1/+142
* Keep transient states the app's while it runs, never stored (018 stage 1)eunhhu2026-10-047-25/+266
* Say how aup chooses what a state outlives, and computes in memory (018)eunhhu2026-10-041-0/+199
generated by cgit v1.2.3 (git 2.46.0) at 2026-10-20 15:50:08 +0000