Data dependency, Computer Engineering

Assignment Help:

Data Dependency:  It refers to the state in which two or more instructions split same data. The instructions in a program can be given based on the relationship of data dependency; this means how two segments or instructions are data dependent on each other. The following types of data dependencies are:

i)  Flow Dependence : If instruction I2 follows I1 and output of I1 turn into  input of

I2, then I2 is called to be flow dependent on I1.

ii)  Antidependence : When instruction I2 follows I1 such that output of I2 overlie

with the input of I1 on the similar data.

iii) Output dependence : When output of the two instructions I1 and I2 overlie on

the similar data, the instructions are supposed to be output dependent.

iv) I/O dependence : When read and write operations by two instructions are raised on the similar file, it is a position of I/O dependence.

Let Consider the following program instructions:

                                                                              I1: a = b

                                                                          I2: c = a + d

                                                                              I3: a = c

In this program section instructions I1 and I2 are Flow dependent as variable  is used by I2 as input and generated by I1 as output.Here, Instructions I2 and I3 are Antidependent as variable is produced by I3 but used by I2 and in order I2 comes first. I3 is flow dependent on I2 because of variable c. Instructions I1 and I3 are Output dependent because variable a is produced by both instructions.


Related Discussions:- Data dependency

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

Explain resource request and allocation graph (rrag), Explain Resource requ...

Explain Resource request and allocation graph (RRAG) Deadlocks can be explained by a directed bipartite graph known as a Resource-Request-Allocation graph (RRAG).A graph G = (V

What is ipc, What is IPC? What are the various schemes available? The t...

What is IPC? What are the various schemes available? The term IPC (Inter-Process Communication) explains various ways by which different process running on some operating syste

Explain about flip-flops, Explain about Flip-Flops  Flip-Flops are also...

Explain about Flip-Flops  Flip-Flops are also called bistable multivibrator.  A flip-flop is capable of storing 1 bit of binary data.  It has two stable states- 'one' and 'zero

What is dom, DOM is the Document Object Model (DOM) which is an interface s...

DOM is the Document Object Model (DOM) which is an interface specification handled by the W3C DOM Workgroup that explains an application independent mechanism to access, parse, or

Explain how a node can be inserted into an avl tree, Explain how a node can...

Explain how a node can be inserted into an AVL tree. We can insert a node into an AVL tree through the insertion algorithm for binary search trees in which we compare the key o

Array, list advantages of array

list advantages of array

What is co-operative process, What is co-operative process? A process i...

What is co-operative process? A process is co-operating if it can affect or be affected by the other processes implementing in the system. Any process that share data with othe

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