EMERGING TRENDS IN COMPUTING
CLOUD COMPUTING
|
Question
[CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER]
|
What is the parallel efficiency(Eff) of an algorithm? Where a task takes time T in uniprocessor system, P is number of processors, M is time taken by each processor.
|
|
Eff = (T*P)/M
|
|
|
Eff = T*(M/P)
|
|
|
Eff = T/(P*M)
|
|
|
Eff = T*P*M
|
Explanation:
Detailed explanation-1: -Where a task takes time T in uniprocessor system, P is number of processors, M is time taken by each processor. (a) Eff = (T*P)/M.
Detailed explanation-2: -Speedup achieved by a parallel algorithm is defined as the ratio of the time required by the best sequential algorithm to solve a problem, T(1), to the time required by parallel algorithm using p processors to solve the same problem, T(p).
There is 1 question to complete.