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

I thought the reason it was generally accepted that the 8-bit lookup table is optimal is because it can fit in the L1 cache.



(Very) embedded developer speaking here. What's this L1 cache you speak of?


It's level 1 CPU cache, the fastest (and smallest) cache.

It caches both instructions and data.

https://en.wikipedia.org/wiki/CPU_cache


It was a joke. Some embedded processors lack a cache.


GP is making the point that not all CPUs have a cache.




Consider applying for YC's Spring batch! Applications are open till Feb 11.

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

Search: