Question: DESCRIPTION: you are trying to compute summation (E!= A[i]) with a parallel processing method. Determine the total run time and speedup, and efficiency when you
![DESCRIPTION: you are trying to compute summation (E!= A[i]) with a](https://dsd5zvtm8ll6.cloudfront.net/si.experts.images/questions/2024/09/66f39166036c5_50166f391657c669.jpg)
DESCRIPTION: you are trying to compute summation (E!= A[i]) with a parallel processing method. Determine the total run time and speedup, and efficiency when you use five processors (PES). Input: Array A of n numbers (n = 64) Output: 1-3 A[i] Task: Parallelize this problem efficiently using an array of processing elements (PES) Assumptions: Computation - Each PE can add two numbers stored in its local memory in one time unit. It is considered as one second. Communication - A PE can send data from its local memory to the local memory of any other PE in three time units (independent of the size of the data). It is considered as three seconds. Input and output - At the beginning of the program, the whole input array A is stored in PE #0. At the end the result should be gathered in PE #0. Synchronization - All PEs operate in lock-step manner; i.e. they can either compute, communicate, or be idle. CAUTION: For this assignment, you need to provide step-by-step drawings with explanations. If you do not submit the drawings with explanations, a huge point deduction will be applied. Please note that you must show the performance when using five processors (PES). If you use different numbers of processors, you will get a zero score. DESCRIPTION: you are trying to compute summation (E!= A[i]) with a parallel processing method. Determine the total run time and speedup, and efficiency when you use five processors (PES). Input: Array A of n numbers (n = 64) Output: 1-3 A[i] Task: Parallelize this problem efficiently using an array of processing elements (PES) Assumptions: Computation - Each PE can add two numbers stored in its local memory in one time unit. It is considered as one second. Communication - A PE can send data from its local memory to the local memory of any other PE in three time units (independent of the size of the data). It is considered as three seconds. Input and output - At the beginning of the program, the whole input array A is stored in PE #0. At the end the result should be gathered in PE #0. Synchronization - All PEs operate in lock-step manner; i.e. they can either compute, communicate, or be idle. CAUTION: For this assignment, you need to provide step-by-step drawings with explanations. If you do not submit the drawings with explanations, a huge point deduction will be applied. Please note that you must show the performance when using five processors (PES). If you use different numbers of processors, you will get a zero score
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
