7. Two processors have 12-stage fetch-execute cycles where branches are determined in stage 8.

One processor is not pipelined, and the other is pipelined. Assuming that tp = 1, answer the

following questions when running a program with 100,000 instructions where 5,000 of the

instructions are conditional branches and each branch, if taken, skips over 8 instructions.

a. How much faster is the pipelined machine over the non-pipelined machine assuming that

no branches are taken.

b. How much faster is the pipelined machine over the non-pipelined machine assuming that

all branches are taken.

c.

Bonus question: Instead of the program having 5,000 branches, how many branches would

the program have to have assuming every branch is taken (and every branch skips over 8

instructions) for the non-pipelined machine to execute the program in the same time as the

pipelined machine?