Posts tagged "performance"

Large API batches reduce request overhead until one bad record makes good records fail with it. A measured way to find the useful batch size and retry unit.

A prefilter can skip most automaton work, but it is heuristic rather than free. I show how candidate frequency and pattern shape decide whether it helps a Rust search.

Linear-time search does not promise constant speed. I explain how automaton size, cache behavior, construction, match density, and pattern shape change real Rust throughput.

A measured additive-increase, multiplicative-decrease controller for finding useful API concurrency while respecting throttling, latency, retries, and tenant isolation.

A Python integer with the value 1 takes 28 bytes, and a million of them cost 36 MB where Rust would use 4. I expected mixed arrays to be slow in V8 and they were not. The cost that did show up was object shape, and it arrives as a cliff at the fifth shape.