Questions: • Assume a decomposition such that each execution of Line 7 is a task. Draw a task- dependency graph and a task-interaction graph. • For n = 16, devise a good mapping for 16 processes and for 8 processes. • How does the above analysis change if log2(n) 1 ? m = Reference: These are Problems 3.15-3.18 from "Introduction to Parallel Computing", Second

A) Construct the Precedence Graph (not containing any redundant or transitive edges) B) Determine if the system above is always determinate. If not, add to  any necessary elements to make it determinate. show steps with answer please!

HELP with this problem!!!!!!!

Please consider the following code fragments (a), (b), (c) and (d) where n is the variable specifying data size and C is a constant. What is the tight bound big-Oh time complexity in terms of n in each case? Show all necessary steps. (a) for (int i = 0; i < n; i = i + 10) ---------for (int j = 1; j < 1024; j = j*2) ---------------Sum[i] += j * Sum[i]; b) for (int i = 1; i < n; i = i*2) ---------for (int j = 0; j < i; j = j+2)  ---------------Sum[i] += j * Sum[i];  c)for (int i = 1; i < n; i = i * 2)  --------for (int j = 1; j < i; j = j * 2)  -------------Sum[i] += j * Sum[i];  d)for (int i = 0; i < n; i++) --------for (int j = 1; j < n; j *= C)  ------------- Sum[i] += j * Sum[i]; (I USED THE DASHED LINES BECAUSE IT WASN'T ALLOWING ME TO SUBMIT WITH EXTRA SPACES. SO, CONSIDER THE DASHED LINES AS SPACES/TABS)