• edited by
13,739 views
39 39 votes

We have two designs $D1$ and $D2$ for a synchronous pipeline processor. $D1$ has $5$ pipeline stages with execution times of $3$ nsec, $2$ nsec, $4$ nsec, $2$ nsec and $3$ nsec while the design $D2$ has $8$ pipeline stages each with $2$ nsec execution time How much time can be saved using design $D2$ over design $D1$ for executing $100$ instructions?

  1. $214$ nsec
  2. $202$ nsec
  3. $86$ nsec
  4. $-200$ nsec

3 Answers

Best answer
51 51 votes
$(B)$ is the correct option for this question.

Execution time for Pipeline = $(K+n-1)*\text{execution_time}$   where $k$ = no of stages in pipeline, $n$ = no of instructions
Execution time = $\max$(all stages execution time)

$D_1 = (5+100-1)*4 = 416$

$D_2 = (8+100-1)*2 = 214$

Time saved using $D_2 = 416-214  =202$
• edited by
2 2 votes

Execution time for pipeline = (K + n - 1 ) $\times$ Tp

Where n = number of instruction , K = number of stages Tp =  pipelene time

For D1: Pipeline time = max(3,2,4,2,3) = 4nsec

For D1: Pipeline time = max(2,2,2,2,2,2,2,2) = 2nsec

Execution time for pipeline D1 = (5 + 100 - 1 ) $\times$ 4nseec = 416nsec

​​​​​​​Execution time for pipeline D2 = (8 + 100 - 1 ) $\times$ 2nseec = 214nsec

Time saved = D1- D2 = 416- 208 = 202

0 0 votes
Total execution time = (k + n – 1) * maximum clock cycle

Where k = total number of stages and n = total number of instructions

 

For D1 :

Total execution time = (5 + 100 – 1) * 4 = 416

 

For D2 :

k = 8 and n = 100

Total execution time = (8 + 100 – 1) * 2 = 214

 

Thus, time saved using D2 over D1 = 416 – 214 =202.
option (B) is correct one
Answer:
Position:
Show:

Related questions

197 197 votes
9 answers 9 answers
78.0k
78.0k views
Kathleen asked Sep 22, 2014
78,029 views
A $5$ stage pipelined CPU has the following sequence of stages:IF – instruction fetch from instruction memoryRD – Instruction decode and register readEX – Execute: ALU op...
78 78 votes
11 answers 11 answers
33.7k
33.7k views
go_editor asked Sep 28, 2014
33,703 views
Consider a $6$-stage instruction pipeline, where all stages are perfectly balanced. Assume that there is no cycle-time overhead of pipelining. When an application is exec...
74 74 votes
4 answers 4 answers
35.6k
35.6k views
Kathleen asked Sep 12, 2014
35,634 views
Which of the following are NOT true in a pipelined processor?Bypassing can handle all RAW hazardsRegister renaming can eliminate all register carried WAR hazardsControl h...
34 34 votes
5 answers 5 answers
14.4k
14.4k views
Ishrat Jahan asked Nov 3, 2014
14,425 views
Consider a $2$-way set associative cache memory with $4$ sets and total $8$ cache blocks $(0-7)$ and a main memory with $128$ blocks $(0-127)$. What memory blocks will be...