XXX YYY ZZZto use Bicc,a?
ADD R1, R2, R3 LSR R3, 4, R4 SETHI 50100, R1 XOR R3, -1, R5 ANDN R3, R6, R7 ASR R4, 12, R8 SUB R7, R5, R4you should find six true dependencies (there are also two false dependencies).
LD [R2+3], R1 ADD R1, 5, R13 AND R13, 255, R14 AND R4, 768, R15 OR R14, R15, R16
How many cycles would it take assuming that the processor supports delayed load? Why will the result with a delayed load be different from the result with a standard load?
Re-arrange the code such that the original semantics are maintained when executing on a machine supporting delayed load. You should find that the re-arranged code will run faster on the original machine - why?
ADD R0, n1, Rx SLL Rx, 10, Rx ADD Rx, n2, Rx SLL Rx, 10, RxNote that the total number of instructions per task will change. Consider an original sequence of 1000 instructions How many instructions will be run if SETHI instructions are replaced?
Has the CPI value improved? Can you explain this change?
Has the performance of the machine improved? Can you explain this in relation to the power of the instruction set?