War (write after read) - data hazards , Computer Engineering

Assignment Help:

WAR (write after read) - Data hazards in computer architecture:

WAR (write after read) - j tries to write at destination before it is read by i , hence i  wrongly gets the new value. This cannot happen in our instance pipeline because all reads are near the beginning (in ID) and all writes are late (in WB). This hazard take place when there are some instructions that write results early on in the instruction pipeline, and other instructions that read a source late on in the pipeline.

Because of the normal structure of a pipeline, which naturally reads values before it writes results, such type of hazards are rare. Pipelines for difficult instruction sets that hold up auto increment addressing and need operands to be read lately in the pipeline could build a WAR hazards.

If we customized the DLX pipeline as in the above instance and also read some operands late, such as the source value for a store instruction, a WAR hazard could be take place. Here is the pipeline timing for such type of potential hazard, highlighting    the stage where the     clash    takes place:

1579_WAR (write after read) - Data hazards.png

If the SW reads R2 at the  time of second half of its MEM2 stage and the Add writes R2 during the first half of its WB stage, the SW will wrongly read and store the value genrated by the ADD instruction.


Related Discussions:- War (write after read) - data hazards

How many precision resistors requires a weighted resistor, A weighted resis...

A weighted resistor digital to analog converter using N bits requires a total of ? Ans. Digital to analog converter, a weighted resistor using N bits needs a total of N precisi

Observed speedup and parallel overhead, Observed Speedup Observed speed...

Observed Speedup Observed speedup of a system which has been parallelized, is defined as:                             Granularity is one of the easiest and most extensi

Code density and smaller faster programs, Q. Code Density and Smaller Faste...

Q. Code Density and Smaller Faster Programs? Memory was very expensive in older computer. So there was a need of less memory utilization, which is it was cost effective to have

General registers in a processor, In this segment, we will give very brief ...

In this segment, we will give very brief details of registers of a RISC system known as MIPS. MIPS is a register-to-register or load/store architecture and employs three address

DLD, Construction of j-k using 4-bit shift register

Construction of j-k using 4-bit shift register

Secondary storage - computer architecture, Secondary storage: Secondar...

Secondary storage: Secondary storage (or external memory) differs from primary storage in that aspect it is not accessible by the CPU directly. The computer typically uses its

Advantage of booth and restoring division algorithm, Describe the advantage...

Describe the advantage of using Booth algorithm? Ans:  a) It achieves efficiency in the number of additions needed when the multiplier has a few large blocks of 1's. b) It

BCD ADDER, create a BCD adder combinational ckt. that adds 2 digit BCD inpu...

create a BCD adder combinational ckt. that adds 2 digit BCD inputs

Assembler directives, What are assembler directives? Ans: These are th...

What are assembler directives? Ans: These are the instructions that direct the program to be executed. They have no binary corresponding so they are called pseudo-opcodes. The

Xml can play when dynamically generating html pages , Explain the role that...

Explain the role that XML can play when dynamically generating HTML pages from a relational database? Ans) Even if student has never participated in a project involving this typ

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd