Question: 1. For a parallel program with p processors on a problem of dimension n, the communication time grows as c + np for some constant

1. For a parallel program with p processors on a problem of dimension n, the communication time grows as c + np for some constant c, while the computation time equals n 3/p, so the total time equals T (n, p) = c + np + n 3/p. (a) For a fixed, constant dimension n and for an increasing number of processors p, find the optimal number of processors for which T (n, p) is minimal. (b) What is the efficiency at the optimal number of processors?

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Databases Questions!