On Mon, Apr 25, 2011 at 10:30 PM, Jon Harrop <jon@ffconsultancy.com> wrote:

> Frédéric wrote:
> That old "invoke" combinator that evaluates a function application on a
> forked process and marshals the result back could be used to implement a
> naïve Parallel.init and, therefore, this solution could be translated to
> OCaml quite easily. However, it would still lack load balancing. That turns
> out to be ok in this particular case because the generated data is quite
> evenly distributed (and we assume that nothing else is running on the
> machine) but real applications might not be so lucky...
>
> Turns out you can also use data flow parallelism entirely by r
>
>
Compare implementations of the adaptive quadrature algorithm. That doesn't
balance so easily :)
http://en.wikipedia.org/wiki/Adaptive_quadrature

Cheers,

-- 
Eray Ozkural, PhD candidate.  Comp. Sci. Dept., Bilkent University, Ankara
http://groups.yahoo.com/group/ai-philosophy
http://myspace.com/arizanesil http://myspace.com/malfunct