hw3f08 - Computer Science and Engineering 431 Computer...

Info iconThis preview shows pages 1–2. Sign up to view the full content.

View Full Document Right Arrow Icon
Computer Science and Engineering 431 Computer Architecture Fall 2008 Homework #3 Distributed : September 24, 2008 Due : October 6, 2008 by midnight via Angel Points : 30 1. Consider the following MIPS code fragments each containing two instructions: (i) addi $1,$1,4 lw $2,8($1) (ii) add $3,$1,$2 sw $3,8($1) (iii) lw $2,8($1) sw $2,200($7) (iv) lw $3,8($1) add $2,$1,$2 (v) beq $1,$0,place sw $1,8($1) For each code fragement identify each type of dependency that exists or may exist (a fragment may have no dependencies) and describe what data flow, name reuse, or control structure causes the dependency. For those cases where dependencies do exist, specify whether or not forwarding can eliminate stalls (bubbles) in the pipeline. 2. Design the forwarding logic needed for a memory-to-memory copy as discussed in class (see slide Chapter 4B.17). Describe it like we did for the EX forwarding logic as on slide Chapter 4B.14. For the additional multiplexor that will need to be added, tell where will its inputs will come from and where its
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Image of page 2
This is the end of the preview. Sign up to access the rest of the document.

Page1 / 3

hw3f08 - Computer Science and Engineering 431 Computer...

This preview shows document pages 1 - 2. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online