A program that takes $4400$ seconds to execute on a single core

has two parts:

$$ PART$-$A prepares the data, is single$-$threaded, and must

complete before PART$-$B starts

$$ PART$-$B processes the data, is multi$-$threaded, and the

algorithm allows for a maximum of $8$chunks$($threads of

execution$)$: B$0$ through B$7$

$$ PART$-$A takes $400$ seconds to execute

$$ Each chunk in PART$-$B take $500$ seconds

$[15$ marks$]$

Calculate the execution time using $1,2,4,8,$ and $16$ cores. Use a

table in your answer with $4$ columns $($Number of Cores, Time to

Complete Part A$,$ Time to Complete Part B$,$ and Total Execution

Time$).$

Explain why the $8-$core and $16-$core results are the same.

Use Amdahl$$s Law to calculate the maximum speedup if an

unlimited number of threads are allowed, and an unlimited number

of cores are available.