Branchless Equivalents of Simple Functions | Harder, Better, Faster, Stronger
Modern processors are equipped with sophisticated branch prediction algorithms (the Pentium family, for example, can predict a vast array of patterns of jumps taken/not taken) but if they, for some…
Branchless Equivalents of Simple Functions | Harder, Better, Faster, Stronger Harder, Better, Faster, Stronger Explorations in better, faster, stronger code. Home About the author About this blog Branchless Equivalents of Simple Functions Modern processors are equipped with sophisticated branch prediction algorithms (the Pentium family, for example, can predict a vast array of patterns of jumps taken/not taken) but if they, for some reason, mispredict the next jump, the performance can take quite a hit. Branching to an unexpected location means flushing the pipelines, prefetching new instructi
Explore this link on the map →saved by
related reading
- Beautiful Branchless Binary Search | Probably Danceprobablydance.com
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- The Aggregate Magic Algorithmsaggregate.org
- abseil / Performance Hintsabseil.io
- Inigo Quilez :: computer graphics, maths, shaders, fractals, demosceneiquilezles.org
- Zenbleedlock.cmpxchg8b.com
- A Gentle Introduction to LLVM IR · mcyoungmcyoung.xyz
- Infographics: Operation Costs in CPU Clock Cycles - 6IT6it.dev
- There are Only Four Billion Floats-So Test Them All! | Random ASCII – tech blog of Bruce Dawsonrandomascii.wordpress.com
- Competitive Programmer's Handbookcses.fi
- Michael Abrash's Graphics Programming Black Book Special Edition: Table of Contentsphatcode.net
- Designing a SIMD Algorithm from Scratch · mcyoungmcyoung.xyz