I wouldn't be shocked if lookup tables win on massively it of order CPUs. Of cou... | Hacker News

Hacker News new | past | comments | ask | show | jobs | submit

login

taeric on Sept 29, 2020 | parent | context | favorite | on: How Many Decimals of Pi Do We Really Need? (2016)

I wouldn't be shocked if lookup tables win on massively it of order CPUs. Of course, I also wouldn't be surprised if it is the it of order nature that makes the polynomial faster.

Would be interesting to see benchmarks. On to my list of things I have a low chance of completing...

exged on Sept 29, 2020 [–]

Once you take SIMD into account, lookup tables frequently lose. Vector gathers are not cheap at all.

Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact