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

Well, if your code now runs much faster because it accesses contiguous memory locations instead of random ones, it's because the computer does less because it avoids expensive cache misses. Similarly with the branch prediction problem. So I don't see much contradiction of the article.


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

Search: