10 Aug
2007
10 Aug
'07
1:01 a.m.
hughperkins:
Haskell/FP seems to have solved the hardest bit of threading, which is making it obvious which bits of a program are parallelizable, and which are not. Remains to actually parallelize out the programs. Am I being naive or is this trivial?
Is there some reason why we cant just start a function running in a single thread, whilst running profiling, then after a while we check which bits of the function are taking time to run, and are parellizable, and we parallelize those out?
Perhaps have a look at this new paper: "Feedback directed implicit parallelism in Haskell" http://research.microsoft.com/~tharris/papers/2007-fdip.pdf -- Don