Question 18Asked in UGC NET Computer Science, June 2015 (Paper II & III, Selected Questions)

In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1–P) is the proportion that…

In the case of parallelization, Amdahl's law states that if P is the proportion of a program that can be made parallel and (1–P) is the proportion that cannot be parallelized, then the maximum speed-up that can be achieved by using N processors is :
  1. A1 / [(1 – P) + N.P]
  2. B1 / [(N – 1)P + P]
  3. C1 / [(1 – P) + P/N]
  4. D1 / [P + (1 – P)/N]
Show answerHide answer

Correct answer: (C) 1 / [(1 – P) + P/N]

Explanation

By Amdahl's law, the serial part (1 – P) cannot be sped up while the parallel part P is divided among N processors, so the maximum speed-up is 1 / [(1 – P) + P/N].

From UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions)

This is question 18 of UGC NET Computer Science PYQ, June 2015 (Paper II & III, Selected Questions). See all questions of this paper with answers, or attempt the paper as a timed online test to get your score and all-India rank.