std.parallel_algorithm

[dsimcha]

On 5/23/2011 1:23 AM, Russel Winder wrote:
> David,
>
> On Mon, 2011-05-23 at 00:00 -0400, dsimcha wrote:
>> Here's some very early work in progress on std.parallel_algorithm:
>>
>> https://github.com/dsimcha/parallel_algorithm/blob/master/parallel_algorithm.d
>>
>> I haven't compiled the docs yet because it's too much of a WIP and
>> doesn't even work without a few modifications I made to std.parallelism.
>>    So far I've got parallel merge, sort and dot product.
>>
>> One issue is that most of these algorithms require pretty fine grained
>> parallelism and the break even point depends on a lot of things, like
>> the details of the hardware.  How should we go about documenting/solving
>> this?  Is it reasonable to always just punt the issue of finding the
>> break even point and whether one is above or below it to the user of the
>> library?  If not, what is a reasonable solution?
>
> Does this requires a version of std.parallelism that is not in the
> standard Phobos?
>
>
> + dmd -m32 -lib std/parallel_algorithm.d
> std/parallel_algorithm.d(379): Error: class std.parallelism.TaskPool
> member defaultWorkUnitSize is not accessible
>
> + dmd -m64 -lib std/parallel_algorithm.d
> std/parallel_algorithm.d(379): Error: class std.parallelism.TaskPool
> member defaultWorkUnitSize is not accessible
>
>

Yeah, I meant to mention that when I was talking about how much of a 
work in progress it is.  I didn't expect anyone to actually want to test 
it this soon.  You need the slightly modified one at:

https://github.com/dsimcha/phobos/blob/master/std/parallelism.d