CECS 341 cheatsheet midterm2.docx - 01 following sequence...

This preview shows page 1 out of 1 page.

Given initial register values: $10 = 0; $20 = 10; $7 = 7; $6 = 6; $1 = 1; [15pts] Trace the program and determine the execution pattern for each branch instruction: branch1: NT, NT, NT, NT, NT, NT, NT branch2=NT, NT, NT, NT, NT, NT, T [4pts] Determine the binary table index to which each branch instruction is mapped: [8pts] All branch prediction buffer table entries contain 11 initially (Predict strongly taken). Show the final content of the branch prediction buffer after the exit label is reached: [8pts] What is the accuracy of the predictor for each branch instruction? 01: addi $20, $0, 100 L1: 02: lw $10, 0($22) 03: add $11, $10, $10 04: add $11, $11, $10 05: lw $12, 0($23) 06: add $14, $11, $12 07: sw $14, 0($23) 08: lw $10, 0($22) 09: add $11, $10, $10 10: lw $12, 0($24) 11: add $14, $11, $12 12: sw $14, 0($24) 13: addi $22, $22, 4 14: addi $23, $23, 4

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture

  • Left Quote Icon

    Student Picture