Subject: Re: [boost] [parallel_sort] Proposal
From: Edouard A. (edouard_at_[hidden])
Date: 2009-02-02 16:06:10
> There is also Boost.ThreadPool on the queue schedule. In case this can
> help you?
Yes, most likely. boost::thread_group didn't do the job, but a thread pool
would be great and would take away a lot of work required to achieve some
sort of optimizations. When is it planned?
I thought about the parallel_merge. It's just a question of dividing one
source into blocks and then find matching blocks in the other source. Once
you have matching pairs, you do a sequential merge on each pair.
You need to divide in blocks small enough so that you won't have starving
threads, but that shouldn't be too small in order to prevent synchronization
overhead to become significant.
Boost list run by bdawes at acm.org, gregod at cs.rpi.edu, cpdaniel at pacbell.net, john at johnmaddock.co.uk