Read after write and write after write - data hazards, Computer Engineering

Assignment Help:

RAW and WAW - Data hazards:

RAW (read after write) - j tries to read a source before i writes it, hence j wrongly gets the old value .This is the most usual type of hazard and the kind that we use forwarding to solve it.

WAW (write after write) - j tries to write an operand before i. The writes end up being performed in the incorrect order, leaving the value written by  i rather than the value written by  j in the destination. This hazard is there only in pipelines that write in more than 1 pipe stage or permit an instruction to proceed even when a preceding instruction is stalled. DLX integer pipeline writes a register just in WB and ignores this class of hazards.

WAW hazards would be possible if we perform the following 2 changes to the DLX pipeline:1)move write back for an ALU operation into the MEM stage, while the data value is available by then. Assume that the data memory access took 2 pipe stages.

Here is a sequence of 2 instructions which showing the execution in this revised pipeline, importance the pipe stage that writes the consequence:

1753_Read after write and write after write - data hazards.png

 Unless this type of hazard is ignored, execution of this sequence on this revised pipeline will leave the result of the first write (the LW) in R1, before the result of the instruction ADD.

Let writes in different pipe stages introduces other problems, since 2 instructions may try to write at the similar clock cycle. DLX FP pipeline, which has both writes in different pipeline lengths and different stages and will deal with both write conflicts and WAW hazards in detail.


Related Discussions:- Read after write and write after write - data hazards

Choosing a micro-controller, There are many different forms of micro-contro...

There are many different forms of micro-controller and a manufacturer, selecting the proper micro-controller for your application is one of the critical decisions which controls th

C++, luminous jewels polishing game

luminous jewels polishing game

Define variants of turing machine, Define variants of Turing Machine?  ...

Define variants of Turing Machine?  Variants are  Non deterministic turing machine.  Mutlitape turing  machine.  Enumerators

How the information can be stored, In a RAM, information can be stored ? A...

In a RAM, information can be stored ? Ans. RAM is used by the user, number of times.

State the important features of operating system, a. Define operating syste...

a. Define operating system? State the important features of operating system? b. Describe the following facilities for implementing interacting processes in programming language

Illustrate the advantages of register transfer, Register Transfer We as...

Register Transfer We assign computer registers by capital letters to denote function of the register. Such as, the register which holds an address for memory unit is usually

Illustration of display on video monitor, Q. Illustration of Display on Vid...

Q. Illustration of Display on Video Monitor? Displaying a single character ; display contents of BL register (Presume that it has a single character) MOV AH, 02H MOV D

What are priority queues, What are priority Queues? There are many queu...

What are priority Queues? There are many queues in which we can insert items or delete items from any of the position based on some property. Now, those queues based on the pro

Explain semaphore, What is a semaphore? Semaphore: It is a synchroniz...

What is a semaphore? Semaphore: It is a synchronization tool which gives a general-purpose solution to controlling access to critical sections.

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