Question: 1. Consider the application comprising seven threads and characterized by the following precedence graph Thread Execution Time D A 10 A B 4 The execution
1. Consider the application comprising seven threads and characterized by the following precedence graph The execution time for each thread is specified in the following table. (i) Compute the average parallelism for the application. (ii) Compute the upper bound on speedup (for N=1..7 ) based on average parallelism and plot your results in the form of a graph. (iii) Compute the lower bound on speedup (for N=1..7 ) based on average parallelism and plot your results in the form of a graph. (iv) Compute the upper bound on speed up using Amdahl's law discussed in class (for N=17 ) and plot your results in the form of a graph. [For each graph in (ii) - (iv) include a table for the x and y axis values for each point. The graphs are to be generated by a tool such as Excel] 2. Consider an application comprising five components. The first three components CO1,CO2, CO3 are characterized by an average parallelism of A,2A and 3A respectively. For each of these components T()=C. These three are independent of each other and are run in parallel. The fourth and fifth components are run only when all the first three components have completed. The fourth component CO4 has an average parallelism of 3A and a T()=0.25C whereas the fifth components has an average parallelism of 4A and a T()=0.25C. What is the average parallelism for the whole application
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
