2,977 views
3 3 votes
Hi, I have a question like how Load/Store operation behave in pipelining, with or without operand forwarding ?

2 Answers

2 2 votes

If operand is present is specified as memeory location the content of it is loaded to a register using load instruction.
the instruction stores data from a specified register to a specified memory location.

Suppose x, y and z are memory location and we want to add the content of location x and y and store the result in memory location z. We can achieve it in 4 instruction
Load R1, x
Load r2, y
Add R3,  R1, R2
Store R3,z

In case of without operand forwarding when instruction is not dependent. we can execute instruction 1 and 2 in parallel using pipelining why we need to run them sequentially,this will enhance effiiciency.

ex:Load R1,x,Load R2,y;

Where as in case of operand forwarding when instruction may or may not be dependent we can use the register

buffer.

Some Advance Pipelining GATE Questions  

 

0 0 votes

Like  we have instruction

1 a=b +c;

2 c=b+a;

we can see 2 is dependent on so 

Without oprand forwarding→ we know that we have 5 stages(fetch,decode,oprand fecth,execute,write back)

as we can see 2 is dependent on so so only after write back stage of instruction 1 is not completed we can go to  2 instruction,so it will result in increasing number of stalls. this is known a data hazard.

Example a=1,b=2,c=3;

a=2+3;

c=2+1;

but a should be 5 accoring to instrution so we can execute the second instruion after the 1st only.this is known a data hazard.

With oprand forwarding=in oprand forward if you know we have a register buffer which stores if store value in buffer just after execution and pass to next instruction so we doesn’t need to write back.it’s decrease number of stalls.

To save from data hazards with decrease number of stalls we use data hazard.

Hope this is clear!

 

Position:
Show:

Related questions

79 79 votes
11 answers 11 answers
33.9k
33.9k views
go_editor asked Sep 28, 2014
33,877 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...
199 199 votes
9 answers 9 answers
78.7k
78.7k views
Kathleen asked Sep 22, 2014
78,739 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...
74 74 votes
4 answers 4 answers
35.9k
35.9k views
Kathleen asked Sep 12, 2014
35,856 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...
0 0 votes
0 0 answers
1.6k
1.6k views
iarnav asked Sep 21, 2018
1,636 views
Consider a 4 stage pipeline processor. The number of cycles needed by the four instructions I1, I2, I3, I4 in stages S1, S2, S3, S4 is shown below: What is the number of...