1. Amdahl's Law.
(a) If a problem of size T has a serial component Q, then show that T=Q is an upper bound on its speedup, no matter how many processing elements are used.
(b) Consider a parallel processor with 8 cores. You have a program that requires 20 minutes if it is executed sequentially. If 10% of the program must remain sequential, then what is the speedup and the efficiency if the remaining part is fully parallelizable on the 8 core machine?
Required minimum 2 page