URGENT

O . For each of the following RISC-V program segments described below, specify the total execution time in case of a single cycle implementation and in case of a pipelined implementation. Also state the pipelining speedup for each segment. For single cycle and pipelining, assume clock periods to be 1000 ns and 250 ns respectively. Do not ignore the clock cycles needed to warm up the pipeline. A program segment having 3 instructions (assume no hazards) A program segment having 45 instructions (assume no hazards) A loop having 20 instructions and repeated for 3000 iterations (assume no data hazards and perfect branch prediction. Also assume that the BEQ instruction is the last instruction in the sequence of 20 instructions). The following function (the same function of Assignment1 Problem1). Assume that: 1) x10 is set to 228 before the function call 2) We have perfect branch prediction 3) No forwarding mechanism is implemented F1: addi x2, x2, -4 sw x18, 0(x2) lui x18, 28 ori x18, x18, 17 blt x10, x18, L1 add x10, x10, x11 beq x0, x0, Ex Ll: sub x10, x10, x11 Ex: lw x18, 0(x2) addi x2, x2, 4 jalr x0, 0(x1) The same function above with same assumptions about the value of x10 and branch prediction, but this time assume that full-forwarding is supported. O . For each of the following RISC-V program segments described below, specify the total execution time in case of a single cycle implementation and in case of a pipelined implementation. Also state the pipelining speedup for each segment. For single cycle and pipelining, assume clock periods to be 1000 ns and 250 ns respectively. Do not ignore the clock cycles needed to warm up the pipeline. A program segment having 3 instructions (assume no hazards) A program segment having 45 instructions (assume no hazards) A loop having 20 instructions and repeated for 3000 iterations (assume no data hazards and perfect branch prediction. Also assume that the BEQ instruction is the last instruction in the sequence of 20 instructions). The following function (the same function of Assignment1 Problem1). Assume that: 1) x10 is set to 228 before the function call 2) We have perfect branch prediction 3) No forwarding mechanism is implemented F1: addi x2, x2, -4 sw x18, 0(x2) lui x18, 28 ori x18, x18, 17 blt x10, x18, L1 add x10, x10, x11 beq x0, x0, Ex Ll: sub x10, x10, x11 Ex: lw x18, 0(x2) addi x2, x2, 4 jalr x0, 0(x1) The same function above with same assumptions about the value of x10 and branch prediction, but this time assume that full-forwarding is supported