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:
- $\dfrac{1}{(1-P)+N.P} \\$
- $\dfrac{1}{(N-1)P+P} \\$
- $\dfrac{1}{(1-P)+\frac{P}{N}} \\$
- $\dfrac{1}{P+\frac{(1-P)}{N}}$