Re: Taking advantage of L1 and L2 cache in sort

[Philip Rowlands]

On Tue, 2 Mar 2010, Pádraig Brady wrote:

> Currently when sorting we take advantage of the RAM vs disk
> speed bump by using a large mem buffer dependent on the size of RAM.
> However we don't take advantage of the cache layer in the
> memory hierarchy which has an increasing importance in modern
> systems given the disparity between CPU and RAM speed increases.
[snip data]

Interesting results; this type of analysis might also benefit from 
running the various tests under cachegrind, which would give detailed 
results about L1/L2 cache miss rates.


Cheers,
Phil