Due Oct 5, 5pm either in person or by email

• 1.4
• 1.5
• Consider the following piece of code

ADD R1, R2, R3

NOT R4, R2

ADD R3, R1, R3

SUB R3, R3, R4

MUL R1, R4, R3

AND R2, R4, R3

XOR R4, R1, R3

BNE R4, R1, _LABEL

Assume unlimited resources, we are only limited by dependence between the instructions. How many cycles I need to runt his code?

Use register renaming and count how many cycles?