News for hackers. Stuff that matters.
Re:Parallelism and the Limits of (programming) Languages by steerb on Monday April 09, 2012 @11:20AM (#3817320)
I tend to agree.

Let's assume a sufficiently smart compiler can parallelize 90% of our hot code. Now considering Amdahl's Law, we cannot achieve a speedup greater than 10 and are therefore stuck. Adding 10 or more cores won't do any good to our running time, because it is dominated by the sequential code.

Re:Parallelism and the Limits of (programming) Languages by evincarofautumn on Monday April 09, 2012 @12:25PM (#3817658)
I have a hunch that the trick to writing the sufficiently smart compiler of legend is in deriving nondeterministic parallel cousins to sequential algorithms. In simple terms, if you could quickly compute potential solutions and verify them, then you could get a speedup in the average case. I doubt NC=P (that no problem is inherently sequential), but we could perhaps tackle many real-world problems with this line of thinking.
Re:Parallelism and the Limits of (programming) Languages by steerb on Monday April 09, 2012 @05:36PM (#3819369)
This sounds somewhat similar to (software) transactional memory.