Question

speedup that can be achieved?
The pipeline of Fig. 9-2 has the following propagation times. 40 ns for the
operands lo be read from memory into registers R1 and R2 65 ms for the
signal to propagate through the multiplier, 5 ns for the transfer into R3, and
15 ns to add the two numbers into RS.
a. What is the minimum dack cyde time thuat can be used?
b. A nonpipaline system can pestore the saune operation by removing R3
and R4. How long willit take to multiply and add the operands without
using the pipeline?
e. Calculate the speedup of the pipeline for 10 tasks and again for 100 tasks.
What is the muomum speedup that can be seved?​

Answer 1

Explanation:

Hy I am not going to be able to make it to the bright