Chapter 5, Problem 19RETC

Explanation of Solution

Explanation:

Let us assume that there is a k-stage pipeline and the clock cycle time is t_p. suppose we have n number of tasks or instructions to process. Then the time required to complete the task1 is $\text{k}\text{×}{\text{t}}_{\text{p}}$ time to complete. The remaining tasks emerge from the pipeline one per cycle, which implies a total time for these tasks of $\text{(}\text{n}\text{-}\text{1}\text{)}{\text{t}}_{\text{p}}$.

Therefore, to complete n tasks using a k-stage pipeline requires:

$\text{k}\text{×}{\text{t}}_{\text{p}}\text{+}\text{(n}\text{-}\text{1}\text{)}\text{×}{\text{t}}_{\text{p}}\text{=}\text{(}\text{k}\text{+}\text{n}\text{-}\text{1}\text{)}\text{×}$