On Tue, 30 Mar 2004, Simon Marlow wrote:
> The upshot of what he found is that we could benefit from some
> prefetching, perhaps on the order of 10-20%. Particularly prefetching
> in the allocation area during evaluation, to ensure that memory about to
> be written to is in the cache, and similar
On Sat, 27 Mar 2004, Adrian Hey wrote:
> Also, I have a hunch that not only is eager evaluation inherently
> more efficient (in terms of the raw number of operations that need
> to be performed), it's probably more cache friendly too (you probably
> end up with code that looks far more like a trad
On Wed, 12 Nov 2003, Tom Pledger wrote:
> Hal Daume III writes:
> :
> | *all* i care about is being able to quickly calculate the size of
> | the intersection of two sets. these sets are, in general, very
> | sparse, which means that the intersections tend to be small.
> |
> | for example,
