5. Use software pipelining to reschedule the following loop to remove all stalls. Do not provide the start-up or finish-up code but specify how many iterations worth of each operation must appear in...

need help

Extracted text: 5. Use software pipelining to reschedule the following loop to remove all stalls. Do not provide the start-up or finish-up code but specify how many iterations worth of each operation must appear in both the start-up and the finish-up code. Assume the fmult.d takes 4 cycles to execute and the fadd.d takes 3 cycles to execute. This code performs z[i] = (x[i] + c1) * (y[i] + c2) where cl and c2 are stored in fl and f4 respectively. Loop: fld f0, 0 (x1) f2, f0, f1 f3, 0 (x2) f5, f3, f4 f6, f2, f5 f5, 0 (x3) х1, х1, 8 х2, х2, 8 х3, х3, 8 x1, x4, Loop fadd.d fld fadd.d fmul.d fsd addiw addiw addiw bne