https://www.chegg.com/homework-help/questions-and-answers/problem-1-exploring-instruction-flow-instruction-level-parallelism-ilp-consider-following--q44507674

This is the link for the question.

I want the answer for this question.

Problem 1. Exploring Instruction Flow and and Instruction level parallelism: ILP Consider the following pseudo-assembly code. Top: A. LOAD R1 = Mem[1234] B. LOAD R2 = Mem[42] C. ADD R4 = R1 + R2 D. LOAD R3 = Mem 1976) E. BEQ R4, #0, Foo E. SUB R1 = R3 - #1 G. XOR R5 = R1 0xfffffff H. ADD R1 = R1 + 1 I. JUMP Bar Foo: J. LOAD R3 = Mem[2000] K. ADD R2 =R4 + #13 L. MUL R3 = R3 x R2 Bar: M. ADD R2 = R4 +R5 N. SUB R4 = R1 - #8 0. XOR R1 = R3^ Oxfofofofo (a) Draw the Data-flow Graph observing all control dependencies and all register data dependencies (RAW, WAR and WAW) assuming the conditional branch (E) is not taken (falls through to F). What is the ILP? (b) Repeat, but only for true dependencies (no control dependencies) (c) Repeat, but only for true dependencies (no control dependencies) and assuming (E) is taken (branches to HINT: The intention of the problem is not to use a specific pipeline. It is however, to identify different kinds of data dependences and the degree of ILP (Instruction Level Parallelism) achievable. Problem 1. Exploring Instruction Flow and and Instruction level parallelism: ILP Consider the following pseudo-assembly code. Top: A. LOAD R1 = Mem[1234] B. LOAD R2 = Mem[42] C. ADD R4 = R1 + R2 D. LOAD R3 = Mem 1976) E. BEQ R4, #0, Foo E. SUB R1 = R3 - #1 G. XOR R5 = R1 0xfffffff H. ADD R1 = R1 + 1 I. JUMP Bar Foo: J. LOAD R3 = Mem[2000] K. ADD R2 =R4 + #13 L. MUL R3 = R3 x R2 Bar: M. ADD R2 = R4 +R5 N. SUB R4 = R1 - #8 0. XOR R1 = R3^ Oxfofofofo (a) Draw the Data-flow Graph observing all control dependencies and all register data dependencies (RAW, WAR and WAW) assuming the conditional branch (E) is not taken (falls through to F). What is the ILP? (b) Repeat, but only for true dependencies (no control dependencies) (c) Repeat, but only for true dependencies (no control dependencies) and assuming (E) is taken (branches to HINT: The intention of the problem is not to use a specific pipeline. It is however, to identify different kinds of data dependences and the degree of ILP (Instruction Level Parallelism) achievable