| Commit message (Expand) | Author | Age | Files | Lines |
|---|
| * | Measure 018 stage 2: a graph search in one event, the pairs, and runs to comp... | eunhhu | 2026-10-04 | 34 | -0/+511 |
| * | Say what a transient state saves a write (018 stage 1, research 117) | eunhhu | 2026-10-04 | 3 | -0/+87 |
| * | Say what an app's tokens cost (017 3b, research 116) | eunhhu | 2026-10-04 | 2 | -0/+109 |
| * | Say what apps that change on a running host showed (017 stage 3, research 115) | eunhhu | 2026-10-04 | 43 | -14/+605 |
| * | Measure how long an app changing module cannot answer, against a host restart... | eunhhu | 2026-10-04 | 6 | -0/+293 |
| * | Trade stores with the WSL2 too: its bytes are the Pi's (029, research 114) | eunhhu | 2026-10-04 | 4 | -0/+27 |
| * | Run Pure and aup on an x86_64 WSL2 and an M3 Mac against the Pi (029) | eunhhu | 2026-10-02 | 26 | -0/+3806 |
| * | Measure wires on the sending loop, and a host's threads (028) | eunhhu | 2026-10-01 | 6 | -7/+211 |
| * | Measure one sending loop against a thread a link, with and without push (028) | eunhhu | 2026-10-01 | 7 | -0/+338 |
| * | Push a turn's sends to a link at once, and round only the links that want one... | eunhhu | 2026-10-01 | 2 | -3/+5 |
| * | Measure sending between two apps of a host: local outlet or link (112) | eunhhu | 2026-10-01 | 6 | -0/+166 |
| * | Measure one host of many apps against a process each (111) | eunhhu | 2026-10-01 | 58 | -0/+546 |
| * | Measure 07047c3 again on a quiet Pi (110) | eunhhu | 2026-09-30 | 25 | -0/+96 |
| * | Count instructions where timing cannot tell 3% apart (110) | eunhhu | 2026-09-30 | 62 | -0/+718 |
| * | Say that prefetching items did not pay, and why (109) | eunhhu | 2026-09-30 | 17 | -0/+201 |
| * | Say what snapshots cost the owner, and what reusing their nodes gave (107) | eunhhu | 2026-09-30 | 24 | -2/+259 |
| * | Find pure-serve's owner by its thread, and sort its samples as 106 does | eunhhu | 2026-09-30 | 1 | -45/+74 |
| * | Say what TPC-C costs when SQLite commits in groups too, and with four warehou... | eunhhu | 2026-09-30 | 19 | -0/+372 |
| * | Say what the windows and checkpoints cost (013 steps 2 and 3, 104) | eunhhu | 2026-09-30 | 3 | -8/+22 |
| * | Say where a node's memory goes, and the budget it now keeps (104, 013) | eunhhu | 2026-09-30 | 5 | -0/+261 |
| * | Say what adopting the link took, and how it fares against ngtcp2 (102) | eunhhu | 2026-09-29 | 1 | -0/+124 |
| * | Let ngtcp2's handshake through a path that reorders | eunhhu | 2026-09-29 | 1 | -1/+8 |
| * | Put ngtcp2 beside quinn in M6, as it is in M5 | eunhhu | 2026-09-29 | 2 | -66/+210 |
| * | Put ngtcp2 beside quinn in M5, as the design planned | eunhhu | 2026-09-29 | 4 | -0/+505 |
| * | Say LOST when a run's epoch is not known, and let its sender begin again at once | eunhhu | 2026-09-29 | 1 | -0/+2 |
| * | Say that a receiver moved to another machine is followed, and how (100) | eunhhu | 2026-09-29 | 1 | -0/+4 |
| * | Move M2's node to another machine under load (M3's harness) | eunhhu | 2026-09-29 | 2 | -11/+88 |
| * | Keep a sender's congestion state as one, so an episode undoes it whole | eunhhu | 2026-09-29 | 1 | -2/+2 |
| * | Say what epochs cost a link, and what the search for it found (099) | eunhhu | 2026-09-29 | 4 | -0/+87 |
| * | Move a link to a new epoch now and then, so keys that leak later open nothing... | eunhhu | 2026-09-29 | 1 | -3/+4 |
| * | Give M2's devices a timer each, and say when the slow records were made | eunhhu | 2026-09-29 | 1 | -7/+34 |
| * | Measure a link on paths of loss, reordering and a bottleneck, against quinn (... | eunhhu | 2026-09-29 | 1 | -0/+126 |
| * | Let M6's path waver by 1 ms when flows share it, and count from 20 s of 60 | eunhhu | 2026-09-29 | 1 | -6/+9 |
| * | Record one round of M6 with the path's MTU found, before pacing (020) | eunhhu | 2026-09-29 | 1 | -0/+42 |
| * | Let the M6 simulator queue records at a rate and time each one | eunhhu | 2026-09-29 | 1 | -5/+33 |
| * | Start M6's flows together, each a process, and count their shares from 10 s | eunhhu | 2026-09-29 | 1 | -26/+63 |
| * | Find how large a packet the path carries: 1,452 bytes once a probe is acknowl... | eunhhu | 2026-09-29 | 2 | -4/+4 |
| * | Record M6 with records in parts and no path MTU yet (020) | eunhhu | 2026-09-29 | 1 | -0/+126 |
| * | Queue only the way to the receivers behind M6's bottleneck | eunhhu | 2026-09-29 | 2 | -18/+30 |
| * | Apply a link's records in transport.c as a host does | eunhhu | 2026-09-29 | 1 | -11/+20 |
| * | Measure a link on a path of loss, reordering and a bottleneck (M6 harness) | eunhhu | 2026-09-29 | 3 | -31/+374 |
| * | Wait for late packets, undo what they cost, and grow as CUBIC | eunhhu | 2026-09-29 | 1 | -0/+165 |
| * | Make the load generator's devices real link senders, many on one thread | eunhhu | 2026-09-29 | 2 | -380/+153 |
| * | Keep a link's two sides as state alone, the sockets and threads apart | eunhhu | 2026-09-29 | 1 | -3/+3 |
| * | Let links know nothing of the core: the host names inputs and shapes | eunhhu | 2026-09-29 | 1 | -6/+15 |
| * | Put the links and the crypto they use in link/, a part of their own | eunhhu | 2026-09-29 | 2 | -7/+8 |
| * | Measure the drains again with the outbox as a list (096) | eunhhu | 2026-09-29 | 1 | -0/+18 |
| * | Measure the CPU a record costs a link, against quinn (096) | eunhhu | 2026-09-29 | 4 | -21/+267 |
| * | Send a record whole when it fits a packet, however many pieces it has | eunhhu | 2026-09-29 | 1 | -6/+20 |
| * | Wake a link's thread only when it sleeps, once | eunhhu | 2026-09-28 | 1 | -0/+165 |
