Given loop: LOOP: LDUR X10, [X1, #0] LDUR X11, [X1, #8] ADD X12, X10, X11 SUBI X1, X1, #16 CBNZ X12, LOOP 1) Assume that perfect branch prediction is used (no stall due to control hazard), that has full forwarding support, and that branches are resolved in ID stage. Show a pipeline execution time diagram for the first two iterations of this loop. 2) Assume branches are predicted as not-taken (but actually taken) the first time and predicted taken (but actually not-taken) the second time. Assume full forwarding support and that branches are resolved in EX stage. Show the execution time diagram for the first two iterations of this loop.
Given loop:
LOOP: LDUR X10, [X1, #0]
LDUR X11, [X1, #8]
ADD X12, X10, X11
SUBI X1, X1, #16
CBNZ X12, LOOP
1) Assume that perfect branch prediction is used (no stall due to control hazard), that has full forwarding support, and that branches are resolved in ID stage. Show a pipeline execution time diagram for the first two iterations of this loop.
2) Assume branches are predicted as not-taken (but actually taken) the first time and predicted taken (but actually not-taken) the second time. Assume full forwarding support and that branches are resolved in EX stage. Show the execution time diagram for the first two iterations of this loop.
Trending now
This is a popular solution!
Step by step
Solved in 3 steps with 1 images