A program can be parallelized at 90 %. Calculate theasymptotic speedup using Amdahl’s law. The serial program runs in 10 hours. Whatis the critical time that no parallel algorithm will be able to beat? Deduce again themaximal speedup. Same questions when only 1 % of the code can be parallelized.
2 (Estimating the fraction of parallelizable code for Amdahl’s law) Showthat one can estimate the ratio of parallelizable code using the formula αpar = 1

S −1

1

P −1 ,

where S is the measured speedup observed when using P processors. Deduce aformula for the maximal speedup given the measured speedup S achieved whenusing P processors.