News for hackers. Stuff that matters.
Re:Coding tricks I learnt at Apple by btilly on Friday June 10, 2011 @05:15PM (#2642443)
It does carry over to L3/L2/L1 cache, but only if the tree is designed to benefit from that. See http://blogs.msdn.com/b/devdev/archive/2007/06/12/cache-obli... for one strategy to do that. (With that structure lookups become faster, but walking the tree in order becomes difficult.)
Re:Coding tricks I learnt at Apple by wickedchicken on Saturday June 11, 2011 @08:29PM (#2645268)
This is a really great article and I wish I could give you some more points to make this appear higher. I once used a cache-oblivious matrix transpose algorithm that was startlingly simple and effective but I didn't know the approach had been so widely applied. Thanks!