[Solved]Question 1a 1b Thank Small See Please Tell Edit Order Make Images Bigger Thank Q37136856

question 1a and 1b thank you and if it is too small too seeplease tell me how to edit it,in order to make the images biggerthank you

& Calculus Early Transcendent. e Get Homework Help WithC ‘N click to enlarge my pdf ima 3 Watch One Punch Man Se芷 4yw A GhNTF-BX An × + ﹀ O Search or enter web address 라!焔 – + Add nates る ノロhit to page A? Read aoud iD Page view 1 of 2 Answer the following questions supposing the code listing shown starts from main). text fun: # int fun (int s) { addi $sp, $sp, -8 sw ra , 0($sp) blez $a0, base sw $a0, 4 ($sp) addi $a0, $a0, 1 jal fun j done #if (s > 0) fun (s) ; r base: addi $v0, $zero, 0 # else r 0; done: 1w $ra, 0 ($sp) lw $a0, 4 ($sp) addi $sp, $sp, 8 jr $ra # return r; } # int main() { main: addi $sp, $sp, -8 sw $ra, 0 ($sp) sw $s0, 4 ($sp) addi $s0, $zero, 0 # x = 0 addisao, 두zero, 2 #i=2 loop: blez Sao, end # while ( i > 0) { nop jal fun add5s0, $s0, Sv0 # x=x + fun (1); addi $a0, $a0 ,-1 # i–. j loop end addi $v0, $s0, 0 lw $s0, 4 ($sp) 1w $ra, 0 ($sp) addi $sp, $sp, 8 jr $ra # return x; } O Type here to search ーく-3 we trh One Punch Man Sar Calculus Early Transcendent. ← → C) G) Soarch or cnter web address 2 of 2 e Get Homework Help WithC ‘N Click to enlarge my pdf ima 4yw A aGhNTF-8XAn × + 다!宿 + ? ノロhit to page As Reed aoud iD Page view Add nates – Consider a computer that uses a 5-stage pipelined MIPS processor with full forwarding support and ID stage branches. (a) Describe the changes needed to add a 2-bit dynamic branch predictor with 8 entries in the branch history table (BHI) and branch target buffer (BTB). Be sure to consider datapath and control modifications. Draw the state machine of the branch predictor. The branch predictor is also used for unconditional branch (jump) prediction. (b) The branch predictor is set to the state weakly x” when a new branch is discovered, where “х, is the outcome of the branch, either taken or not-taken. The predictor and BTB are updated after the branch result and target are calculated, i.e., during EX stage of the branch instruction. Identify which branch instructions of the program share the same index in the branch prediction tables, if any. Show the state of the branch prediction structures for each of the branches at each time they are executed on the sheet named PredictorState of the provided Excel workbook, then fill in the following table with their final state when the program completes. BHT Index PC of branch decimaliinstructian Value in Branch Target BufferBranch Predictor State (Complele the pipeline diagra for the program with the pipeline modifications from (a) aud (b), taking into consideration branch prediction behavior from (c). and the stalls and squashes due to hazards. There is no branch delay slot. Complete the provided Excel workhook with your diagram on the sheet named PipelineDiagram. Submission Instructions O Type here to search Show transcribed image text & Calculus Early Transcendent. e Get Homework Help WithC ‘N click to enlarge my pdf ima 3 Watch One Punch Man Se芷 4yw A GhNTF-BX An × + ﹀ O Search or enter web address 라!焔 – + Add nates る ノロhit to page A? Read aoud iD Page view 1 of 2 Answer the following questions supposing the code listing shown starts from main). text fun: # int fun (int s) { addi $sp, $sp, -8 sw ra , 0($sp) blez $a0, base sw $a0, 4 ($sp) addi $a0, $a0, 1 jal fun j done #if (s > 0) fun (s) ; r base: addi $v0, $zero, 0 # else r 0; done: 1w $ra, 0 ($sp) lw $a0, 4 ($sp) addi $sp, $sp, 8 jr $ra # return r; } # int main() { main: addi $sp, $sp, -8 sw $ra, 0 ($sp) sw $s0, 4 ($sp) addi $s0, $zero, 0 # x = 0 addisao, 두zero, 2 #i=2 loop: blez Sao, end # while ( i > 0) { nop jal fun add5s0, $s0, Sv0 # x=x + fun (1); addi $a0, $a0 ,-1 # i–. j loop end addi $v0, $s0, 0 lw $s0, 4 ($sp) 1w $ra, 0 ($sp) addi $sp, $sp, 8 jr $ra # return x; } O Type here to search
ーく-3 we trh One Punch Man Sar Calculus Early Transcendent. ← → C) G) Soarch or cnter web address 2 of 2 e Get Homework Help WithC ‘N Click to enlarge my pdf ima 4yw A aGhNTF-8XAn × + 다!宿 + ? ノロhit to page As Reed aoud iD Page view Add nates – Consider a computer that uses a 5-stage pipelined MIPS processor with full forwarding support and ID stage branches. (a) Describe the changes needed to add a 2-bit dynamic branch predictor with 8 entries in the branch history table (BHI) and branch target buffer (BTB). Be sure to consider datapath and control modifications. Draw the state machine of the branch predictor. The branch predictor is also used for unconditional branch (jump) prediction. (b) The branch predictor is set to the state weakly x” when a new branch is discovered, where “х, is the outcome of the branch, either taken or not-taken. The predictor and BTB are updated after the branch result and target are calculated, i.e., during EX stage of the branch instruction. Identify which branch instructions of the program share the same index in the branch prediction tables, if any. Show the state of the branch prediction structures for each of the branches at each time they are executed on the sheet named PredictorState of the provided Excel workbook, then fill in the following table with their final state when the program completes. BHT Index PC of branch decimaliinstructian Value in Branch Target BufferBranch Predictor State (Complele the pipeline diagra for the program with the pipeline modifications from (a) aud (b), taking into consideration branch prediction behavior from (c). and the stalls and squashes due to hazards. There is no branch delay slot. Complete the provided Excel workhook with your diagram on the sheet named PipelineDiagram. Submission Instructions O Type here to search

Expert Answer

---

Answer to question 1a and 1b thank you and if it is too small too see please tell me how to edit it,in order to make the images bi… . . .