Q$1$: Consider two different machines, with two different instruction sets, both of which have a clock rate of $100$ GHz $.$ The following measurements are recorded on the two machines running a given set of benchmark programs:

$($Marks$=2)$

$\backslash$table$[[$Instruction Type,Instruction Count $($millions$),$Cycles per Instruction$],[($Machine A$),,],[$Arithmetic and logic,$4,3],[$Load and store,$3,4],[$Branch$,2,5],[$Others$,5,5],[$Machine$($B$),,],[$Arithmetic and logic,$5,2],[$Load and store,$6,4],[$Branch$,2,6],[$Others$,2,2]]$

$($a$)$ Determine the effective CPI, MIPS rate for each machine.

$($b$)$ Comment on the results which machine is better.

Q$2$: Consider A benchmark program is run on a $20$ MHz processor. The executed program consists of $100,000$ instruction executions, with the following instruction mix and clock cycle count:

$($Marks$=2)$

$\backslash$table$[[$Instruction Type,Instruction Count,Cycles per Instruction$],[$Integer Arithmetic,$40000,2],[$Data Transfer,$35000,1],[$Floating Point,$20000,4],[$Control Transfer,$5000,3]]$

The above program running on a single processor such that a fraction $0\mathrm{.}5$ of the execution time involves code that is inherently serial and a fraction $0\mathrm{.}5$ that involves code that is infinitely parallelizable with no scheduling overhead. Let T be the total execution time of the program using a single processor.

$($a$)$ Calculate the execution time for the above program.

$($b$)$ Calculate the speedup using a parallel processor with $8$ processors that fully exploits the parallel portion of the program by exploiting Amdahl's law?hu