Re: [boost] (no subject)

From: Michael Fawcett (michael.fawcett_at_[hidden])
Date: 2007-03-16 17:07:28

On 3/16/07, Gennadiy Rozental <gennadiy.rozental_at_[hidden]> 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