All TechSheets

#c++

3 articles

Case-Folding Code at Memory Speed: How Branch-Free Loops Hit 45 GiB/s
PerformanceSystems

Case-Folding Code at Memory Speed: How Branch-Free Loops Hit 45 GiB/s

An architectural deep-dive into branchless byte-space arithmetic, SWAR, and SIMD techniques for ultra-high-throughput string normalization.

T
Thanga·
7 min read
Case-Folding Source Code at Memory Speed: Branchless Loops and Byte-Space Arithmetic
PerformanceAlgorithms

Case-Folding Source Code at Memory Speed: Branchless Loops and Byte-Space Arithmetic

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.

T
Thanga·
9 min read
Case-Folding Code at 45 GiB/s: Branch-Free Arithmetic and SIMD Search
PerformanceAlgorithms

Case-Folding Code at 45 GiB/s: Branch-Free Arithmetic and SIMD Search

Learn how branch-free byte-space arithmetic and SIMD vectorization push case-insensitive code search to the physical limits of memory bandwidth.

T
Thanga·
9 min read