Related reading
Faster Maps: Chasing Swiss Speed
ParparVM’s HashMap suffered catastrophic miss latency due to linear probing on dense integer keys. By adopting CPython‑style perturbed probing (Swiss‑table style) and extending tagged immediate values to more primitives, miss latency dropped from 32 s to ~45 ms, allocation pressure fell dramatically, and overall performance stayed roughly flat despite a modest hit‑time slowdown.
CodeName Onecodenameone.com8 min- 1 points
Saving another 100TB of RAM with math (and Rust)
Cloudflare reduced the memory footprint of its Pingora Backend Router by re‑examining the consistent‑hashing implementation in the pingora‑ketama library. By increasing the number of virtual hash points per server from the default 1 to the standard 160 (and applying weighted hashing based on disk capacity), they cut the per‑node overhead enough to reclaim >100 TB of RAM across the fleet. The post…
Vectorized and performance-portable Quicksort (2022)
Google’s Highway library now includes a fully portable SIMD‑vectorized quicksort that runs 9‑19× faster than C++ std::sort. By using compress‑store (or permute‑based emulation) for partitioning, the same C++ code targets AVX2, AVX‑512, NEON, SVE and RISC‑V V. Benchmarks show 0.5 GB/s on an Apple M1 and >1 GB/s on a 3 GHz Skylake, beating prior architecture‑specific sorts. The implementation and a…
Hacker News front pagegoogleblog.com3 minHN460142Building Distributed Sliding-Window Rate Limiters in TypeScript and Redis
This guide details building a distributed sliding-window rate limiter using TypeScript and Redis. It leverages Redis sorted sets and an atomic Lua script to prevent race conditions and over-admission under high concurrency, supporting dual RPM/TPM quotas.
SitePointsitepoint.com18 min
