viewquestions/2917/What are the steps that are taken to decode an instruction code
The Eduladder is a community of students, teachers, and programmers just interested to make you pass any exams. So we solve previous year question papers for you.
See Our team
Wondering how we keep quality?
Got unsolved questions?

Ask Questions
Hey! Want to work with us? Our youtube channel See our Jd Want to apply? Do it today

Use Me  ?

New searches
Advance-Computer-Architecture-10CS74-unit-6-->View question


Q.65) Instruction execution in a processor is divided into 5 stages. Instruction Fetch(IF), Instruction Decode (ID), Operand Fetch(OF), Execute(EX), and Write Back(WB), These stages take 5,4,20, 10 and 3 nanoseconds (ns) respectively. A pipelined implementation of the processor requires buffering between each pair of consecutive stages with a delay of 2 ns . -gate computer science 2017

Two pipelined implementations of the processor are contemplated: 
(i) a naïve pipeline implementation (NP) with 5 stages and 
(ii) an efficient pipeline (EP) where the OF stage id divided into stages OF1 and OF2 with execution times of 12 ns and 8 ns respectively. 

The speedup (correct to two decimals places) achieved by EP over NP in executing 20 independent instructions with no hazards is ________________. 

A) 1.50-1.51
B) 1.51-1.52
C) 1.52-1.53
D) 1.53-1.54


By:satyashiromani

Taged users:
|aksingh1818|LupiN|Johnny|milan-ransingh|Jessika-K|milanyoyoyogmailcom|Purnima|satyashiromani|DEEPAK202|vaishnavi-Deshpande|Umang|Aparna-Dasgupta|iamknown|ThreeRed|Msshikhil|harshshah822|Lee5941|dillu550|deepuckraj|123|Manisha12|pankaj|prajwalamv|gagandeep|Raaghav-singhal|metaphor|Govt|Aaditi|madachod|tichaona-garaidenga

Likes:
|satyashiromani|aksingh1818|deepuckraj

Dislikes:
Be first to dislike this question

Talk about thisDelete|Like|Dislike|


Answers

A) 1.50-1.51

Explanation :-
 
Given, total number of instructions (n) = 20 
For naive pipeline (NP):
Number of stages(k) = 5
Clock time (Tp) = max { (stage delay+buffer delay) } = { 7, 6, 22, 12, 5 } = 22 nsec
Execution time (Enp) = ( k + n - 1 )*Tp = ( 5 + 20 - 1 )*22 = 528 nsec
For efficient pipeline (EP):
number of stages(k) = 6 ( delay with 20 nsec stage is divided into 12 nsec and 8 nsec )
Clock time (Tp) = max { (stage delay+buffer delay) } = { 7, 6, 14, 10, 14, 5 } = 14 nsec
Execution time (Eep) =  ( k + n - 1 )*Tp = ( 6 + 20 - 1 )*14 = 350 nsec
Therefore, Speedup = (Enp) / (Eep) = 528 / 350 = 1.508 

This explanation is contributed by Satya Shiromani

deepuckraj

Likes:
Be first to like this answer

Dislikes:
Be first to dislike this answer
Talk about this|Once you have earned teacher badge you can edit this questionDelete|Like|Dislike|
------------------------------------

Can you help us to add better answer here? Please see this



Not the answer you're looking for? Browse other questions from this Question paper or ask your own question.

Join eduladder!