Derive an expression for the speedup ratio (i.e., the ratio of the execution time without pipelining to the execution time with pipelining) of a pipelined processor in terms of the number of stages in the pipeline m and the number of instructions to be executed N.

What will be an ideal response?

Suppose that the number of instructions to be executed were N. It would take N clocks + m ? 1 to execute. The
factor (m ? 1) is due to the time for the last instruction to pass through the pipeline. The speedup relative to an
unpipelined system that would require N?m cycles (N instructions executed in n stages) is N?m/(N + m ? 1).