Mumbai University > Computer Engineering > Sem 8 > parallel and distributed systems

Marks: 5M

The ability to overlap stages of a sequential process for different input tasks (data or operations) results in an overall theoretical completion time of

$$T_pipe=m.P+(n-1).P$$

Here n is the number of input tasks, m is the number of stages in the pipeline, and P is the clock.

The three basic …