Darren New wrote:

>> I don't know much about how CPU caches work, but I imagine having the 
>> data scattered over several memory pages isn't very cache-friendly.
> 
> I don't think it's a matter of being spread over several pages, but a 
> matter of having small pieces (much smaller than a cache line) being 
> randomly accessed.

How wide is a typical cache line?

IIRC, a Haskell linked list node is 3 pointers wide.

> If you're using linked lists, even going 
> sequentially will cause the cache accesses to be unhelpful, because 
> xyz[37] isn't next to xyz[38].

Although, if they happen to be allocated sequentially, they might 
possibly be...

Post a reply to this message