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
saved by
related reading
- Algorithms for Modern Hardware - Algorithmicaen.algorithmica.org
- Beautiful Branchless Binary Search | Probably Danceprobablydance.com
- The Aggregate Magic Algorithmsaggregate.org
- Inigo Quilez :: computer graphics, maths, shaders, fractals, demosceneiquilezles.org
- Competitive Programmer's Handbookcses.fi
- Zenbleedlock.cmpxchg8b.com
- A Gentle Introduction to LLVM IR · mcyoungmcyoung.xyz
- Infographics: Operation Costs in CPU Clock Cycles - 6IT6it.dev
- Spatialspatial-lang.org
- The time the x86 emulator team found code so bad that they fixed it during emulationdevblogs.microsoft.com
- CSAPP_2016.pdfcs.sfu.ca
- There are Only Four Billion Floats-So Test Them All! | Random ASCII – tech blog of Bruce Dawsonrandomascii.wordpress.com