What are some problems that are prone to parallelization? When I think about this, the first thing that comes to my mind is matrix multiplication, which yields to faster calculations, meaning you can get speed ups easily. Any other examples like this?
Asked By : Yunyao
Answered By : Peter
Tasks that are easily parallelizable are sometimes called embarassingly parallel. Straightforward examples are computing fractals like Julia or Mandelbrot sets (since all points are independent of each other) or brute-force searches.
You can find many other examples on the wikipedia page.
Best Answer from StackOverflow
Question Source : http://cs.stackexchange.com/questions/11565
0 comments:
Post a Comment
Let us know your responses and feedback