6. We are comparing two processors' performances where both have an 8-stage fetch-execute

cycle, one processor is pipelined and the other is not. Assume tp = 1.25 and we run a program

of 100,000 instructions on both processors. To compute how much faster the pipelined machine

is, use cycles of slower machine / cycles of faster machine.

a. How much faster is the pipelined processor assuming no stalls arise?

b. How much faster is the pipelined processor assuming there is 1 stall every 4 instructions?

c. How much faster is the pipelined processor assuming there is 2.2 stalls every instruction?

d. Bonus question: How many stalls per instruction would be required so that the two

processors had equal performance?