SUB X5, X15, X4 Suppose we modify the pipeline so that it has only one memory (that handles both instructions and data). In this case, there will be a structural hazard every time a program needs to fetch an instruction during the same cycle in which another instruction accesses data. 1- Draw a pipeline diagram to show where the code above will stall. 2- In general, is it possible to reduce the number of stalls/ NOPs resulting from this structural hazard by reordering code (reordering the instructions)? 3- Must this structural hazard be handled in hardware? We have seen that data hazards can be eliminated by adding NOPs to the code. Can you do the same with this structural hazard? If so, explain how. If not, explain why not. 4- If we run the code above on a single-cycle computer, what kind of hazards are there?

SUB X5, X15, X4 Suppose we modify the pipeline so that it has only one memory (that handles both instructions and data). In this case, there will be a structural hazard every time a program needs to fetch an instruction during the same cycle in which another instruction accesses data. 1- Draw a pipeline diagram to show where the code above will stall. 2- In general, is it possible to reduce the number of stalls/ NOPs resulting from this structural hazard by reordering code (reordering the instructions)? 3- Must this structural hazard be handled in hardware? We have seen that data hazards can be eliminated by adding NOPs to the code. Can you do the same with this structural hazard? If so, explain how. If not, explain why not. 4- If we run the code above on a single-cycle computer, what kind of hazards are there?

Database System Concepts

7th Edition

ISBN:9780078022159

Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan

Chapter1: Introduction

Section: Chapter Questions

Problem 1PE

See similar textbooks

Similar questions

You are given snapshots of the MIPS pipeline from two successive cycles. For each figure, fill in all the relevant information in each stage, corresponding to the instruction in that stage at that cycle. Remember to specify clearly how control signals are set. Assume $x contains x * 100 (e.g. $1 contains 100). MIPS instructions used: add rd, rs, rt rd = rs + rt or rd, rs, rt rd = rs or rt lw rt, I(rs) rt = Mem[rs + I] (load word) sw rt, I(rs) Mem[rs + I] = rt (store word)
Problem 1: (a) Draw pipeline diagram (FI, DI, FO, EI, WO) with one memory port for the following instructions: MOV [1234], 035 ADD [1234], AX SUB BX, CX XOR CX, BX PUSH CX (b) Write the code for the following. Rewrite the code to reduce hazards by instruction rescheduling: [a] = [c]-[e] [b] = [a] + [d] [c] = [f] + [e]
clock cycle at which the first of the instructions is fetched as clock cycle 1. Assume that if one instruction reads a register during the same clock cycle as another instruction is writing it, the new value will be read. Do not reorder the instructions. Instructions are fetched and executed exactly in the order given below, with the pipeline stalling if necessary.addi $s2, $s2, 1li $s6, 5add $s1, $s2, $s3move $s5, $s6lw $t1, 0($s5)
Consider the following assembly code: Instruction Description LOAD R1, M1 Read data from memory address M1 and store in R1. XOR R2, R1, R1 Logical Ex-OR between contents of R1 with R1 and store result in R2 BNEZ R2, Target1 Jump to Target if R2 is non-Zero ADD R7, R1, R5 Add contents of R1 and R5 and store to R7 AND R2, R7, R7 Logical Ex-OR between contents of R7 with R7 and store result in R2 Targetl: BEZ R2, Target2 Jump to Target if R2 is Zero LOAD R3, M2 LOAD R4, M3 ADD R10, R3, R4 Target2: ADD R10, R3, R4 STORE M4, R10 Save contents of R10 to memory address M4 END
5. Pipelined datapath has five stages, ie., instruction fetch (IF), decode (ID), execution (EX), memory (MEM), and write back (WB). It has a hazard detection unit. An instruction will be stalled at the decode stage if any of its operands isn't ready. Consider executing the following code on this datapath (1) At the end of fifth cycle of execution, what instruction will be in each of the pipeline stages? (If there is any "bubble" in the pipeline, please write "NOP" in the corresponding pipeline stage.) (5%) You must write the answer with the following format. instruction IF instruction lw $r2, 10($1) sub $r4, $13, Sr2 add $r5, Sr6, $7 and Sr8, Sr4,$r5 IF ID EX (2) If the datapath has a forwarding unit to resolve the data hazard, what instruction will be in each of the pipeline stages at the end of the fifth cycle? (If there is any "bubble" in the -pipeline, please write "NOP" in the corresponding pipeline stage.) (5%) You must write the answer with the following format: (D MEM EX WB.…
What is the state of the 8088’s flags after executing the instructions in parts (a)through (c) of problem 7?(in photo) Assume that the following initial state exists before executing the instructions. (AX) = 8001H (SI) = 0200H (DI)= 0300H (DS:100H) = F0H (DS:200H) = F0H (DS:201H) = 01H (DS:300H) = 34H (DS:301H) = 12H
Q:..
How do "hazard detection units" help in identifying potential problems in the instruction flow within a pipeline?
CPI stands for clock cycles per instruction. Speedup from pipelining = (Number of pipeline stages) / (Achieved CPI ). Assume a 5-stage pipeline. Assume that CPI = 1 when there are no pipeline stalls (the ideal case). Now assume that every branch instruction causes a 3 clock cycle stall in the pipeline. Assume that for the program being executed 30% of executed instructions are branch instructions. What speedup from pipelining is achieved by this program?
Identify data hazards, if any in the following instruction while processing through a pipelined processor. Show its implementation through a 4-stage pipelined porcessor having: Fetch Unit – Decode Unit – Execution Unit and Write Result Unit ADD R10, R2, R3 OR R8, R10, R9 XOR R1, R10, R11 AND R6, R1, R7 SUB R4, R1, R5
The following sequence of MIPS instructions is processed using a 5-stage pipeline, as discussed in class. What is the minimum number of clock cycles are required, from start to finish? Assume that, if necessary, only pipeline stalls (not data forwarding) can be used to prevent data hazards. lw $1,0($2) addi $3,$3,1 add $2,$1,$1 add $5,$4,$4
Consider the code below that runs in the five stage pipeline that does not handle any data hazard (no forwarding and no write/read register in the same cycle). Add NOP operations so that the code runs correctly. You may draw a time diagram to help you answer the question. ADDI X1, X2, #3 ADD X3, X1, X2 ADDI X4, X1, #13 ADD X5, X3, X2