Given an array A of n numbers for which we want to compute the sum. We have 8 Processors namely PE#0, PE#1, PE#2, P#3, P

Business, Finance, Economics, Accounting, Operations Management, Computer Science, Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Algebra, Precalculus, Statistics and Probabilty, Advanced Math, Physics, Chemistry, Biology, Nursing, Psychology, Certifications, Tests, Prep, and more.
Post Reply
answerhappygod
Site Admin
Posts: 899604
Joined: Mon Aug 02, 2021 8:13 am

Given an array A of n numbers for which we want to compute the sum. We have 8 Processors namely PE#0, PE#1, PE#2, P#3, P

Post by answerhappygod »

Given an array A of n numbers for which we want to compute the sum.
We have 8 Processors namely PE#0, PE#1, PE#2, P#3, P#4, P#5, P#6 and P#7
Draw a block diagram (as demonstrated in the lecture) to show the steps.
Refer to Lecture 3 for further details and background.
Important:
Upload Your Calculations When Submitting the response.
DO NOT just write the answer - Explain Each Step.
Given an array A of n numbers for which we want to compute the sum. We have 8 Processors namely PE#0, PE#1, PE#2, P#3, P#4, P#5, P#6 and P#7 Compute the Parallel Run Time with 8 processors. Compute the Speed-up Ratio. Compute Efficiency. How much time is spent on computation? How much time is spent on communication? Assumptions: •Computation: Each PE can add two numbers stored in its local memory in one time unit. •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) •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. Thus, it is not possible to overlap computation and communication on this architecture. Draw a block diagram (as demonstrated in the lecture) to show the steps. n Refer to Lecture 3 for further details and background.
Join a community of subject matter experts. Register for FREE to view solutions, replies, and use search function. Request answer by replying!
Post Reply