edited by
3,714 views
0 votes
0 votes

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. $\dfrac{1}{(1-P)+N.P} \\$
  2. $\dfrac{1}{(N-1)P+P} \\$
  3. $\dfrac{1}{(1-P)+\frac{P}{N}} \\$
  4. $\dfrac{1}{P+\frac{(1-P)}{N}}$
edited by

2 Answers

Best answer
1 votes
1 votes

C is ans

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:

selected by
Answer:

Related questions

1 votes
1 votes
1 answer
2
go_editor asked Jul 30, 2016
1,658 views
Match the following:$\begin{array}{|ll|ll|} \hline \text{a.} & \text{Forelward Reference Table} & i. & \text{Assembler directive} \\ \hline \text{b.}& \text{Mnemonic Tab...