844 views
Consider a non­pipelined processor design which has a cycle time of 10ns and average CPI of

1.4. The maximum speedup pipelined processor can get by pipelining it into 5 stages and each stage takes 2ns is

Mk Utkarsh verify my approach

Without pipeline:

CPI = 1.4--->  one instruction takes 1.4 clocks and suppose we have n instructions then

(1.4*n)*10  to complete them

With pipeline:

first instruction takes 5 clocks then (n-1) takes 1 clock per instruction.

==> (5+ (n-1) *1)*2

Speed up = without /with ==> ~7   -> as n is approaching large value

I'm getting 7

Speedup=Execution time unpipeline/Execution time pipelined

=(1.4*10)/(1*2) =7

Coreect me if I'm wrong

You are right. Answer will be 7.

I'm getting 5
Speedup=T old/T new
=10/2=5

### 1 comment

wrong
Initially it was taking cycle time of 10ns. (unpipe)

After pipelined, CT cycle time is max of all stage i.e., 2ns.

Speed up = 10/2 = 5
here nothing is told about n, so in that case we'll take n = infinity.

when n = infinity,

$S$ = $\frac{T_{n}}{t_{p}}$

where $T_{n}$ is the time to execute a single instruction in Non-pipelined processor.

$t_{p}$ is the clock cycle time in pipelined processor.

So, $T_{n}$ = CPI * 10ns = 14ns

$t_{p}$ = 2 ns

S = 7
by
Speed up = Exec. time non pipeline/ Exec. time pipeline

=10*1.4/2 = 7
by