31 Jan
2012
31 Jan
'12
4:19 p.m.
on Tue Jan 31 2012, Olaf van der Spek <ml-AT-vdspek.org> wrote:
On Tue, Jan 31, 2012 at 4:10 PM, Kai Schroeder <kaischroeder3@googlemail.com> wrote:
Especially since some hash table implementations (e.g. intel's threading building blocks) only use the last few bits to determine the bucket, this can lead to very bad caching behaviour for the rather common case of regularly sampled points (equidistant samplings of power of 2 are e.g. common in computer graphics and numerical algorithms).
Are you aware of this? Would you consider it a bug?
Yes, sounds like a bug in TBB. I don't think it's a good idea to discard bits.
Perhaps not, but it seems to me that we have a problem, too. -- Dave Abrahams BoostPro Computing http://www.boostpro.com