Let a program P be composed of a part R that can be ideally parallelized, and
of a sequential part S; that is, P = R S. On a single processor, S takes 10% of
the total execution time and during the remaining 90% of time R could run in
parallel.
(a)What is the maximal speedup reachable with unlimited number of processors?
(b) How is this law called?
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here