Question: Computer Architecture How much time the following code sequence takes when executed without forwarding and with forwarding? Can you reorder the code to avoid all
Computer Architecture
How much time the following code sequence takes when executed without forwarding and with forwarding? Can you reorder the code to avoid all stalls? if yes, please reorder the code and execute the code with forwarding while providing the time it takes. Assume that each clock cycle takes 100 femto sec. lhu ri, 0(18) srl r8, r1, 2 sh ri, 0(r8) and r10, rii, r11 slt r8, rl, r8 Execution without forwarding takes cycles. Execution without forwarding takes fs Execution with forwarding takes cycles. Execution with forwarding takes fs. Reordered Code: - lhu ri, 0 (r8) srl r8, r1, 2 sh ri, 0 (r8) and r10, r11, r11 slt r8, ri, r8 Execution with code scheduling (reordering) and with forwarding takes cycles. Execution with code scheduling (reordering) and with forwarding takes fs
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
