aboutsummaryrefslogtreecommitdiffstats
path: root/docs/research/048-immutable-read-write-overlap.md
diff options
context:
space:
mode:
authoreunhhu <[email protected]>2026-09-29 15:26:30 +0100
committereunhhu <[email protected]>2026-09-29 15:26:30 +0100
commit56d6876f906f91db9f48f0f27b7f456ee601efd9 (patch)
treee779511d147a808737a4fa786e867b3f4ba7b462 /docs/research/048-immutable-read-write-overlap.md
parent7ad006f6f2d52c105ce6767d34fbd8a7abed4012 (diff)
downloadpure-56d6876f906f91db9f48f0f27b7f456ee601efd9.tar.gz
pure-56d6876f906f91db9f48f0f27b7f456ee601efd9.zip
Cut what a small record costs a link: no division a record, no walk a delivery
Profiling both sides in one thread, without sockets (61-byte records): the rings of records and flights divided for each place, the record a number names was found three times over, a record in one part was searched for its part, and the receiver walked the line record by record to hand it over and again to let it go. The rings are powers of two long and now masked; a record is found once; a one-part record's part is the first; a line of a batch or less goes whole without a walk, and a delivery applied whole lets its bytes go at once. The protocol alone: 0.171 to 0.162 us a record. M5 (the link and listener threads, sockets too), five rounds against the commit before: 61 B 0.298 to 0.287 us, 1 KiB 2.63-2.90 to 2.48-2.79 us, 16 KiB the same or less; quinn measured 0.31, 3.85 and 60 us in the same rounds. test-link's results are the same to the byte.
Diffstat (limited to 'docs/research/048-immutable-read-write-overlap.md')
0 files changed, 0 insertions, 0 deletions