16 Mar
2007
16 Mar
'07
9:07 p.m.
On 3/16/07, Gennadiy Rozental <gennadiy.rozental@thomson.com> wrote:
So? could you give an example of an algorithm? And/or other speific performace advantage example?
I just constructed a quick test and used VTune and std::clock to sample. Here are my results: sorting across 1,000,000 random integers (averaged across 5 runs) std::list::sort - 6.87s boost::ilist::sort - 4.45s number of L2 cache requests (L1 cache misses) std::list - 1,790 boost::ilist - 862 I've never really exported VTune results before, but I think it's possible if anyone wants detailed reports and/or the source code for the benchmark. --Michael Fawcett