In a presentation of Guy Steele for ICFP 2009 in Edinburgh:
http://www.vimeo.com/6624203
he considers foldl and foldr harmful as they hinder parallelism
because of Process first element, then the rest Instead he proposes
a divide and merge aproach, especially in the light of going parallel.
The
Johann Höchtl johann.hoec...@gmail.com writes:
In a presentation of Guy Steele for ICFP 2009 in Edinburgh:
http://www.vimeo.com/6624203
he considers foldl and foldr harmful as they hinder parallelism
because of Process first element, then the rest Instead he proposes
a divide and merge
Isn't it the kind of things Data Parallel Haskell is achieving ? I'm in
no way an expert of the field, but from what I've read on the subject it
looked like :
I have a list of N elements and I want to map the function F on it.
technically, I could spawn N processes and build the result from that,
On Thu, Feb 11, 2010 at 11:00:51AM +0100, Ketil Malde wrote:
Johann Höchtl johann.hoec...@gmail.com writes:
In a presentation of Guy Steele for ICFP 2009 in Edinburgh:
http://www.vimeo.com/6624203
he considers foldl and foldr harmful as they hinder parallelism
because of Process first
On Feb 11, 2010, at 3:41 AM, Johann Höchtl wrote:
In a presentation of Guy Steele for ICFP 2009 in Edinburgh:
http://www.vimeo.com/6624203
he considers foldl and foldr harmful as they hinder parallelism
because of Process first element, then the rest Instead he proposes
a divide and merge
On Feb 11, 2010, at 9:41 PM, Johann Höchtl wrote:
In a presentation of Guy Steele for ICFP 2009 in Edinburgh:
http://www.vimeo.com/6624203
he considers foldl and foldr harmful as they hinder parallelism
because of Process first element, then the rest Instead he proposes
a divide and merge
