Repeat 4.28.2, but this time use your MIPS code from 4.28.3. Exercise 4.28.3. Rearrange your code from

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 statically scheduled processor from Figure 4.69.

80000180 Instruction memory ++ Sign extend Registers Sign- extendi x x ALU ALU Write data Data memory Address

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

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.a. b. R2 R5 J R8 R6 a R9 R1 b R10 R2 R11 R3 Free R3, R4, R5 R10,R11,R12

Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Computer Organization And Design The Hardware Software Interface

ISBN: 9780123747501

4th Revised Edition

Authors: David A. Patterson, John L. Hennessy

Question Posted: