Go backward to Global Communication Go up to Top Go forward to Unstructured/Dynamic Communication |
$S$_{i} = X_{i}+S_{i-1}Concurrency only for multiple summations!
$$sum_{i=0}^{2n-1}X_{i}=sum_{i=0}^{2n-1-1}X_{i}+sum_{i=2n-1}^{2n-1}X_{i}Concurrency within one summation!
divide&conquer: if base_case then solve_problem else partition problem into L and R solve subproblem L with d&c solve subproblem R with d&c combine solutions of L and R