Hacker News new | ask | show | jobs
by 01HNNWZ0MV43FF 61 days ago
This is good data, but I'm not sure what the actionable is for me as a Grug Programmer.

It means if I'm doing very light processing (sums) I should try to move that to structure-of-arrays to take advantage of cache? But if I'm doing something very expensive, I can leave it as array-of-structures, since the computation will dominate the memory access in Amdahl's Law analysis?

This data should tell me something about organizing my data and accessing it, right?

1 comments

Even in code where performance is a serious concern, you don't need to feel guilty about using a data structure that is an array of pointers to 4 kbyte chunks or a tree of such chunks. 4K is linear enough that using a completely flat array probably won't be significantly faster.