7 articles
Discover how GitHub eliminated CPU branch mispredictions and achieved 45+ GiB/s single-core case-folding throughput using SIMD, SWAR, and byte-space arithmetic.
An architectural deep-dive into how modern search engines case-fold billions of bytes of source code at hardware memory limits using branch-free SWAR and byte-space arithmetic.
An architectural deep-dive into branchless byte-space arithmetic, SWAR, and SIMD techniques for ultra-high-throughput string normalization.
Learn how branchless bit arithmetic and SIMD vectorization enable case-folding source code at memory bandwidth limits without CPU branch mispredictions.
Learn how branch-free loops, bitwise arithmetic, and SWAR/SIMD vectorization enable source code case-folding at over 45 GiB/s on a single CPU core.
Learn how branch-free byte-space arithmetic and SIMD vectorization push case-insensitive code search to the physical limits of memory bandwidth.
Learn how branch-free loops and SWAR byte-space arithmetic eliminate CPU pipeline stalls to case-fold source code at memory bandwidth speeds.