Subject: Re: [boost] [SORT] Parallel Algorithms
From: Thorsten Ottosen (tottosen_at_[hidden])
Date: 2015-01-14 04:49:20
On 14-01-2015 03:52, Steven Ross wrote:
>> I examined the TBB version and the secret is the sample sort algorithm.
>> The version of TBB is provisional and it's not exception safe. I am working
>> in the design of a new version of this algorithm exception safe. The actual
>> version of the parallel stable algorithm is about 20% slower than the TBB
>> version in the worse case, but when the size of the elements grows, the
>> indirect version is faster than all the others, with 64 bytes, is around
>> 10% faster than the best TBB version, with 128 bytes , the best version of
>> TBB is around a 90% slower, and with 256 is 240% slower.
>> Yes, indirect sorting is clearly superior for large data types, and it
> would be good to make it as easy as possible to use. It'd be nice to also
> have a simple wrapper that can be use the spreadsort algorithm with
> indirect sorting too.
Larger, non-fast movable data types?
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk