Problem $2$

Setup

Consider the parallel procedure $\frac{\frac{?}{?}}{\text{\$}}$ text$($SUMARRAYS$)|$$ for performing pairwise addition on $|$$$n|$$$-$element arrays $|$$$A\frac{1\text{:}n}{\frac{?}{?}}|$ and $|$$$B[1$:$n]|$$$,$ storing the sums in $|$$$C[1$:$n]|$$$.$

$|$$text$($SUM$-$ARRAYS$)($A$,$ B$,$ C$,$ n$)|$$

parallel for $\frac{\frac{?}{?}}{\text{\$}}i=1|$$$|$ to $\frac{\frac{?}{?}}{\text{\$}}n|$$$|$

$\frac{\frac{?}{?}}{?}$ text $()$ C$[$i$]=$ A $[i]+B\frac{i}{\frac{?}{?}}$$

Part A

Rewrite the parallel loop in $|$$text$($SUMARRAYS$)\backslash$$ using recursive spawning in the manner of $||$ $text$($P$-$MAT$-$VEC$-$RECURSIVE$)|$$$|.$ Analyze the parallelism.

Setup

Consider another implementation of the parallel loop in $|$$text$($SUM$-$ARRAYS$)$ $ $ given by the procedure $\frac{\frac{?}{?}}{\text{\$}}$ text$($SUM$-$ARRAYS'$)$