Subject: Re: [boost] [threadpool] version 22 with default pool
From: Edouard A. (edouard_at_[hidden])
Date: 2009-03-09 17:50:25
> we are alreadt ~3.7 times better. I suspect tbb::parallel_sort doesn't
> use a std::sort as base algorithm.
They actually use std::sort. Why should they use something else? :)
I wonder if we could do better with a median of 3 pivot selection.
> > for(int count = ::GetTickCount(); count != target; count =
> > ::GetTickCount());
> > This is a trivial spin to make sure the tasks eat up some CPU for the
> > desired amount of ms.
> May be you can do the test, I work on cygwin.
I will do it, yes, but not today. ;)
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk