Java fork join algorithm analysis [closed]

Question

I am doing a study (as part of a course requirement) on the new Fork-Join framework in Java 7 and analyze the performance improvement compared to the conventional threading mechanism. What are the kinds of divide and conquer algorithms that are guaranteed to run faster with the new fork join framework. Can you suggest any non-trivial algorithm I can work on to analyze the performance difference.

Answer 1

You can try N body problem: http://en.wikipedia.org/wiki/N-body_problem
or
You can try parallel sort

Answer 2

Maybe linear algebra problems would be a good fit: LU or QR decomposition, forward-back substitution, an eigenvalue solution method like Jacobi iteration, etc.

Finite element solution of problems in solid mechanics, heat transfer, and fluid mechanics are significant sources of these kinds of problems.