Subject: Re: [boost] [sort] Parallel sorting sub-library mini-review. Performance tests.
From: Christophe Henry (christophe.j.henry_at_[hidden])
Date: 2016-11-22 14:55:33
> The threads are created only 1 time*.
Have I missed something? I checked sample_sort and I saw several sets of
calls to std::async which is likely to create and destroy threads several
>*parallel_sort, sample_sort* : this algorithm is commonly accepted as the
>fastest for the parallel stable sort.
>The implementation is *notoriously faster than the provided by the GCC
>( based on Open MP ) using less memory. TBB don?t
>provide parallel stable sort, and only have an experimental code in their
Indeed, I found it highly interesting.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk