I am trying to calculate the speedup of this, but I am getting the wrong answer:Assuming that we have a program where we have two execution phases. One phase takes 1 time unit to execute and can only execute sequentially. The other phase takes 3 times units to execute sequentially but can be perfectly parallelized. What is the maximum speedup you can achieve?This is how I have tried to calculate it; I've used the parallelization formula, which states: $1/((1-P)+P/n))$Where:S(n) is the theoretical speedupP is the fraction of the algorithm that can be made paralleln is the number of CPU threadsSo using the formula in my case:P is 75% as 3/4 is the total timeI assume n is 1 as nothing is mentioned about it$1/((1-0,75)+0,75))=1$What am I doing wrong?
How do I calculate the speedup properly?
parallel computing;performance;program optimization
If the phase can be perfectly parallelized then $n$ can be arbitrarily large. $\lim_{n\to\infty}\frac{1}{(1-0.75)+0.75/n} = \frac{1}{0.25} = 4$