pipelining with branch instructions

Question

ADD R1,R2,R3

SUB R2,R1,R7

BNEQZ R5,L1

MUL R8,R9,R3

DIV R6,R8,R7

L1:-

LOAD R4, 2(R6)

SUB R10,R4,R11

 

for the above sequence of instructions draw time and space diagram to find out total number of clock cycles required to complete execution without operand forwarding and if branch is not taken

Comments

So total how many cycles would it take 19?

---

Can you please send me any standard textbook reference

---

I am not sure about the number of cycles, I haven't calculated that.

And for reference, do understand that labels are not part of instruction. Labels do not separate codes, code is still executed sequentially (unless goto/jump/call found). Labels are just for ease of use (so that you don't have to calculate addresses yourself). While compiling, the labels would get removed (not necessarily, it can also store the location value of that instruction in a label variable of that name) and any reference to a label would be replaced with correct address of that "labelled" instruction.

You can yourself write a small program, compile it and check the output.You can check out Arduino codes, usually pretty small.

Also read https://en.m.wikipedia.org/wiki/Label_(computer_science)