• Ads help keep this website alive.

What is the fastest way to get an Inverse Square Root? (Part 2)

Part 1: What is the fastest way to get an Inverse Square Root? Last time I covered what the fastest way was for single precision floating point, but what about double precision floating point numbers? Do they behave the same or will we run into even more issues on older hardware? Since the market starts looking towards 128-bit integers and quad precision floating point numbers, it’s time to also test this one while it’s still ‘fresh’. Read more

What is the fastest way to get an Inverse Square Root?

Everyone who works with a 2D or 3D development studio knows that eventually you will run into hardware that is too slow. Wether that hardware is what you currently have or what your target demographic has doesn‘t matter – you‘ll hit this limit, even if you try not to. That‘s why some clever people came up with different ways to make things faster. Seperating the FPU from the IPU, SSE and AVX and the famous Quake III floating point hack. But which one performs the fastest, and can we make that one even faster? Read more