Question: Exercise 1 (i) In the algorithm shown below, assume a decomposition such that each execution of Line 7 is a task. Draw a task-dependency graph
Exercise 1 (i) In the algorithm shown below, assume a decomposition such that each execution of Line 7 is a task. Draw a task-dependency graph and a task-interaction graph . (ii) if n=16, devise a good mapping for 16 processes. (iii) if n=16, devise a good mapping for 8 processes.
1. procedure FFT_like_pattern(A, n) 2. begin 3. m := log2n; 4. for j := 0 to m - 1 do 5. k := 2j; 6. for i := 0 to n - 1 do 7. A[i] := A[i] + A[i XOR 2j]; 8. endfor 9. end FFT_like_pattern
Only the diagram is sufficient .
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
