speedupfirst we take the speedup factor which is


Speedup

First, we take the speedup factor which is we see how much speed up performance we achieve by pipelining. First we take ideal case for measuring the speedup.

Let n be total number of tasks executed during m phases of pipelines. 

Then m phases can process n tasks in clock cycles = m + (n-1)

Time taken to execute with no pipelining = m.n 

Speedup because of pipelining = m.n/ [m + (n-1)]. 

As n>= ∞ There is speedup of n times over non-pipelined execution.

 

Request for Solution File

Ask an Expert for Answer!!
Computer Engineering: speedupfirst we take the speedup factor which is
Reference No:- TGS0323831

Expected delivery within 24 Hours