Answered step by step
Verified Expert Solution
Question
1 Approved Answer
Consider the following codes. I) Loop: L.D f0, 0(r1) ADD.D f4, f0, f2 S.D f4, 0(r1) ADDI r1, r1, #-8 BNE r1, r2, Loop II)
Consider the following codes.
I) Loop: L.D f0, 0(r1) ADD.D f4, f0, f2 S.D f4, 0(r1) ADDI r1, r1, #-8 BNE r1, r2, Loop II) ADDI r1, r1, #-16 L.D f0, 16(r1) ADD.D f4, f0, f2 L.D f0, 8(r1) Loop: S.D f4, 16(r1) ADD.D f4, f0, f2 L.D f0, 0(r1) ADDI r1, r1, #-8 BNE r1, r2, Loop S.D f4, 8(r1) ADD.D f4, f0, f2 S.D f4, 0(r1) a) assume that r1=r2+800. Demonstrate that the two pieces of code I) and II) are functionally equivalent b) assume the standard latencies as we used from the 5-stage pipeline. Calculate how many cycles it takes to execute the codes above. Assume that branch are predicted correctly, and there is no delay in fetching the instruction in the next iteration of the code. This technique to improve the performance is called software pipelining
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started