When parallelizing an application, the ideal specdup is speding up by the number of processors. This is limited by two things. percentage of the application that ean be parallelized and the cost of communication. Amdahl's Law takes into account the former but not the latter.

a What is the spedup with $N$ processors if $80\%$ of the application is parallelizable, ignoring the cost of communication?

b What is the specdup with cight processors if$,$ for every processor added, the communication overhead is $0\mathrm{.}58$ of the criginal exceution time.

c What is the specdup with eight procupos if$,$ for every time the number of processors is doubled, the communicaton overhead is increased by $0\mathrm{.}5\%$ of the original execution time?

d What is the speedup with $N$ processors if$,$ for every tine the numbet of processors is doubled, the connunication overhead is increased by $0\mathrm{.}5\%$ of the original exccution time?

e Write the general cquation that solves this question. What is the number of processors with the highest spedap in an application in which PYo of the original execution time is parallelizable, and, for every time the number of processors is doubled, the communication is increased by $0\mathrm{.}5\%$ of the ongunal exccution time?