Question: Repeat 4.28.2, but this time use your MIPS code from 4.28.3. Exercise 4.28.3. Rearrange your code from 4.28.1 to achieve better performance on a 2-issue
Repeat 4.28.2, but this time use your MIPS code from 4.28.3.
Exercise 4.28.3.
Rearrange your code from 4.28.1 to achieve better performance on a 2-issue statically scheduled processor from Figure 4.69.

Exercise 4.28.1
Translate this C code into MIPS instructions. Your translation should be direct, without rearranging instructions to achieve better performance.
In this exercise we compare the performance of 1-issue and 2-issue processors, taking into account program transformations that can be made to optimize for 2-issue execution. Problems in this exercise refer to the following loop (written in C):![a. for(i=0;i!-j;i+=2) a[i+1]=a[i]; b. for(i=0; i-j;i+=2) b[i]-a[i]-a[i+1]; C Code](https://dsd5zvtm8ll6.cloudfront.net/images/question_images/1698/3/0/6/885653a1b454551c1698306883241.jpg)
When writing MIPS code, assume that variables are kept in registers as follows, and that all registers except those indicated as Free are used to keep various variables, so they cannot be used for anything else.
80000180 Instruction memory ++ Sign extend Registers Sign- extendi x x ALU ALU Write data Data memory Address
Step by Step Solution
3.47 Rating (163 Votes )
There are 3 Steps involved in it
Heres the MIPS code optimized for a 2issue statically scheduled processor from Figure 4... View full answer
Get step-by-step solutions from verified subject matter experts
