std.parallel_algorithm

[Russel Winder]

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


-- 
Russel.
=============================================================================
Dr Russel Winder      t: +44 20 7585 2200   voip: sip:russel.winder at ekiga.net
41 Buckmaster Road    m: +44 7770 465 077   xmpp: russel at russel.org.uk
London SW11 1EN, UK   w: www.russel.org.uk  skype: russel_winder
-------------- next part --------------
A non-text attachment was scrubbed...
Name: signature.asc
Type: application/pgp-signature
Size: 198 bytes
Desc: This is a digitally signed message part
URL: <http://lists.puremagic.com/pipermail/digitalmars-d/attachments/20110523/762df846/attachment.pgp>