We show below a sequence of instructions and ask you to give a maximally parallel execution of them that achieves the same result. Your execution must respect flow (RAW), output (WAW), and anti- (WAR) dependences. We begin with an example to illustrate when this means. Note: we are not concerned with pipelined execution or its hazards here. We are simply identifying independent instruction sequences. Example add x1, x2, x3 lw x4, 0(x5) addi x5, x4, 12 add x6, x7, x8 add x8, x5, x7 # 1 # 2 # 3 # 4 # 5 Answer Maximum parallelism is achieved using three functional units: add x1, x2, x3 lw x4, 0(x5) addi x5, x4, 12 # flow dependence add x6, x7,x8 add x8, x5, x7 # anti-dependence Question 1 add x5, x3, x2 lw x6, 100(x3) addi x6, x6, 1 SW x6, 100(x3) add x10, x9, x8 add x11, x9, x6 add x3, x2, x6 add x8, x7, x9 We show below a sequence of instructions and ask you to give a maximally parallel execution of them that achieves the same result. Your execution must respect flow (RAW), output (WAW), and anti- (WAR) dependences. We begin with an example to illustrate when this means. Note: we are not concerned with pipelined execution or its hazards here. We are simply identifying independent instruction sequences. Example add x1, x2, x3 lw x4, 0(x5) addi x5, x4, 12 add x6, x7, x8 add x8, x5, x7 # 1 # 2 # 3 # 4 # 5 Answer Maximum parallelism is achieved using three functional units: add x1, x2, x3 lw x4, 0(x5) addi x5, x4, 12 # flow dependence add x6, x7,x8 add x8, x5, x7 # anti-dependence Question 1 add x5, x3, x2 lw x6, 100(x3) addi x6, x6, 1 SW x6, 100(x3) add x10, x9, x8 add x11, x9, x6 add x3, x2, x6 add x8, x7, x9