Question

Consider the simple five-stage pipeline (Fetch, Decode, Execute, Memory, Write-back) ADD R1, R2, R3 SUB R4,...

Consider the simple five-stage pipeline (Fetch, Decode, Execute, Memory, Write-back) ADD R1, R2, R3 SUB R4, R1, R5 For the above pairs of instructions, determine how many cycles it would take to complete execution. (1) Without forwarding. (2) With forwarding.

Homework Answers

Know the answer?
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for?
Ask your own homework help question
Similar Questions
Consider a program having following sequence of instructions, where the syntax consists of an opcode followed...
Consider a program having following sequence of instructions, where the syntax consists of an opcode followed by the destination register followed by one or two source registers: Instruction no Instructions 1 ADD R3, R1, R2 2 LOAD R6, [R3] 3 AND R7, R5, 3 4 ADD R1, R6, R0 5 SUB R2, R1, R6 6 AND R3, R7, 15 7 SUB R5, R3, R4 8 ADD R0, R1, R10 9 LOAD R6, [R5] 10 SRL R7, R0, 8 Assume the...
Assume a five-stage single-pipeline microarchitecture (fetch, decode, execute, memory, write- back) and the code given below....
Assume a five-stage single-pipeline microarchitecture (fetch, decode, execute, memory, write- back) and the code given below. All ops are one cycle except LW and SW, which are 1+2 cycles, and branches, which are 1+1 cycles. There is no forwarding. Show the phases of each instruction per clock cycle for one iteration of the loop. Loop: lw x1,0(x2)       addi x1,x1, 1       sw x1,0(x2)       addi x2,x2,4       sub x4,x3,x2       bnz x4,Loop How many clock cycles per loop iteration...
(20pts each) Read the following set of instructions, and answer questions. add     r5, r2, r1 lw...
(20pts each) Read the following set of instructions, and answer questions. add     r5, r2, r1 lw      r3, 4(r5) or      r3, r5, r3 sw      r3, 0(r5) add     r2, r5, r1 Assume there are no forwarding, try reorganize the order of these instructions such that these 5 instructions can be finished sooner. Insert stall cycles only when reordering does not help. Note that reordering instructions should not cause any incorrect value being write into registers. Show the reordered 5...
Suppose a MIPS processor uses the simple 5-stage pipeline described in the text, where the stages...
Suppose a MIPS processor uses the simple 5-stage pipeline described in the text, where the stages are instruction fetch, instruction decode and operand fetch, execute and calculate address, memory access, and register write. Suppose further that • There is a single memory for both instruction and data, which can only support one read or write each cycle. • There is no “forwarding” in the pipeline. Thus, if an instruction B relies on a value written into a register by an...
(20 pts each) Read the following set of instructions, and answer questions. or r1, r2, r3...
(20 pts each) Read the following set of instructions, and answer questions. or r1, r2, r3 or r2, r1, r4 or r1, r1, r2 Assume the following cycle times for each of the options related to forwarding: Without forwarding With full forwarding With only ALU-ALU forwarding 250ps 300ps 290ps ALU-ALU forward means there is only data forward from EX/MEM to ID/EX (which is from the output of the ALU to the input of the ALU), and no data forwarding from...
Given the following sequential list of VEX operations: A. add $r3 = $r1, $r2 B. sub...
Given the following sequential list of VEX operations: A. add $r3 = $r1, $r2 B. sub $r8 = $r1, $r3 C. sub $r7 = $r1, 2 D. add $r1 = $r1, 1 E. mpy $r6 = $r3, $r2 Which VEX operations can be scheduled simultaneously to make up the second VLIW instruction? The constructed schedule should satisfy the following conditions: Assume infinite resources and no limit to the number of operations scheduled to a single instruction. Operations that are scheduled...
ADVERTISEMENT
Need Online Homework Help?

Get Answers For Free
Most questions answered within 1 hours.

Ask a Question
ADVERTISEMENT