Unformatted text preview: 6. Why is the speedup for masterworker parallel implementations of lowcomputation tasks (such as geometric transformations on images) very poor? (10 points) 7. Explain the dynamic load balancing technique referred to as the “fully distributed work pool”. (10 points) 8. Give the three steps of the “divide and conquer” parallelization strategy. (10 points) 9. Give an outline of the fully recursive divide and conquer parallel matrix multiply algorithm. (10 points) 10. Consider square matrix multiply with the fully recursive divide and conquer parallel matrix multiply algorithm. We divide the n × n in four blocks, thus halving the matrix dimension n in each recursive step. The amount of work to combine the results per step is n 2 (four matrix additions in parallel, each addition taking n 2 operations). Give a formula for the total execution time t comp as a function of n (you may assume that n = 2 k ). (15 points) 1...
View
Full Document
 Fall '09
 Message Passing Interface, fully recursive divide, conquer parallel matrix

Click to edit the document details