This preview shows pages 1–3. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: pipeline) – other than the addition of some muxes. Forwarding would be simpler, as forwarding cases increases with the square of the number of stages. 6.23 6.26 6.27 6.28 6.29 6.31 Loop: Sltiu $at $s1 12 Bne $at $0 Cleanup Lw $t0 0($s1) Lw $t1 -4($s1) Lw $t2 -8($s1) Addu $t0 $t0 $s2 Addu $t1 $t1 $s2 Addu $t2 $t2 $s2 Sw $t0 0($s1) Sw $t1 -4($s1) Sw $t2 -8($s1) J Loop Addiu $s1 $s2 -12 # delay slot Cleanup: Beq $s1 $0 Done Lw $t0 0 ($s1) Addu $t0 $t0 $s2 Sw $t0 0($s1) J Cleanup Addiu $s1 $s2 -4 # delay slot Done:...
View Full Document
This homework help was uploaded on 01/29/2008 for the course CS 152 taught by Professor Kubiatowicz during the Spring '04 term at Berkeley.
- Spring '04
- Computer Architecture