Register

Iitm ms/direct phd written test question

1,514 views
1 votes
1 votes
There are 1000 instructions in a program.They are like lw, r, lw, r, lw, .....

lw instructions are load/store type and r instructions are non load/store type.Each lw instruction is dependent only on  rightmost r instruction on it's left and each  r instruction depends only on rightmost lw instruction on it's left. The program is running on a 5 stage(IF,ID,EX,MEM,WB) pipeline.Operand forwarding is used here.What will be the effective cpi?

A) 1.204

B) 1.504

C) 2.204

D) 2.504
User Avatar

1 Answer

Best answer
2 votes
2 votes

Pease verify not sure...

• selected by
User Avatar
Voting & Accepting an answer helps improve the community
← PreviousNext →
← Previous in categoryNext in category →

Related questions

0 votes
0 votes
1 answer
1
SPluto asked May 2, 2019
593 views
IIT Madras MS written test 2019 - TOC - 1
Let L1 and L2 be 2 languages which are not regular. Which of these is true? The union of L1 and L2 is not regular. The intersection of L1 and L2 is not regular. Both I and II are true I is true, II is false I is false, II is true Both I and II are false
Let L1 and L2 be 2 languages which are not regular. Which of these is true?The union of L1 and L2 is not regular.The intersection of L1 and L2 is not regular.Both I and I...
User Avatar
0 votes
0 votes
0 answers
2
SPluto asked May 2, 2019
521 views
IIT Madras MS written test 2019 - Algorithms - 1
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph. Which of the following is true? SP is NP-hard, LP is not LP is NP-hard, SP is not Both are NP-hard Neither SP nor LP is NP-hard
Let SP be the problem of finding the shortest path between 2 nodes, and LP be the problem of finding the longest path between 2 nodes, in an unweighted, undirected graph....
User Avatar
Link Copied!