Subject: Re: [boost] Fwd: [SORT] Parallel Algorithms
From: Steven Ross (spreadsort_at_[hidden])
Date: 2015-06-12 13:46:30
On Thu, Jun 11, 2015 at 12:01 PM Francisco JosÃ© Tapia <fjtapia_at_[hidden]>
> Hi Steven
> I decided to change the benchmarks. I have designed a new compact
> benchmark, with an execution time of aprox 3 min.
> The results are clear and compact and permit an easy evaluation.
> In the attached file you can see the result on my machine
Looks good! I'll verify it on my machine once you're ready for review.
I was amused to see single-threaded spreadsort provide comparable speed to
a parallel algorithm when sorting strings.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk