Explain: If you were to change the architecture to add a branch predictor that was 95% accurate and eliminate the branch delay slots, could you make your solution even faster?

# This code copies data values into a destination array. # The data values are copied from either the 'left' #array or the right array. # For each element position, a "Selector' array tells us which #value to copy into the destination array. # Assume $a0 is selector addr # Assume Sal is left addr #Assume Sa2 is right addr # Assume Sa3 is dest addr # $t0 is an index for keeping an array index # There are 1,000 elements in each ar ray nor $t0, $zero, $zero # set index to -1 j LoopTest nop # Branch delay slot (assume jumps also need it Loop: sll $t1, $te, 2 add \t2, $a0, St1 Multiply the index by 4, we'll use it several places # Compute the selector address # Load the value from the selector array beq $zero, $t2, UseRightValue # If the selector is zero, copy from right array nop # Branch delay slot UseLeftValue $t2, $t3, $a1, $a3, $t1 $t1 # Compute the left address # Compute the dest address # Load the value from the left array # Store the value to the right array # Jump to LoopTest # Branch delay slot Cassume jumps also need it) add add sw $t2, 0CSt3) j LoopTest nop UseRightValue: add $t2, $a2, $t1 add $t3, $a3, $t1 lw $t2, 0CSt2) sw $t2, 0(St3) # Compute the right address # Compute the dest address Load the value from the right array # Store the value to the right array LoopTest addi $t0, St0, 1 slti $t1, $t, 1000 # See if the index is less than one thousand bne $zero, $t1, Loop # If we're not done yet, loop again nop # Advance the index Branch delay slot Exit: # Code is done at this point. # This code copies data values into a destination array. # The data values are copied from either the 'left' #array or the right array. # For each element position, a "Selector' array tells us which #value to copy into the destination array. # Assume $a0 is selector addr # Assume Sal is left addr #Assume Sa2 is right addr # Assume Sa3 is dest addr # $t0 is an index for keeping an array index # There are 1,000 elements in each ar ray nor $t0, $zero, $zero # set index to -1 j LoopTest nop # Branch delay slot (assume jumps also need it Loop: sll $t1, $te, 2 add \t2, $a0, St1 Multiply the index by 4, we'll use it several places # Compute the selector address # Load the value from the selector array beq $zero, $t2, UseRightValue # If the selector is zero, copy from right array nop # Branch delay slot UseLeftValue $t2, $t3, $a1, $a3, $t1 $t1 # Compute the left address # Compute the dest address # Load the value from the left array # Store the value to the right array # Jump to LoopTest # Branch delay slot Cassume jumps also need it) add add sw $t2, 0CSt3) j LoopTest nop UseRightValue: add $t2, $a2, $t1 add $t3, $a3, $t1 lw $t2, 0CSt2) sw $t2, 0(St3) # Compute the right address # Compute the dest address Load the value from the right array # Store the value to the right array LoopTest addi $t0, St0, 1 slti $t1, $t, 1000 # See if the index is less than one thousand bne $zero, $t1, Loop # If we're not done yet, loop again nop # Advance the index Branch delay slot Exit: # Code is done at this point