Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

Earlier this month I was looking at the question of "why does it take 160ms to scan a list of just 60,000 items?

The answer turned out to be "because they're not adjacent and on this embedded system every single cache miss costs you hundreds of nanoseconds".

I strongly agree that, like woodworkers, performance improvers should measure before they take out the power tools.



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

Search: