Data dependency, Computer Engineering

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.

Posted Date: 3/1/2013 7:19:08 AM | Location : United States

Related Discussions:- Data dependency, Assignment Help, Ask Question on Data dependency, Get Answer, Expert's Help, Data dependency Discussions

Write discussion on Data dependency
Your posts are moderated
Related Questions
Why object oriented development not only allows reuse In a wider way we can say that object oriented development not only allows reuse and information sharing within an applica

Q. Explain Time Complexity in Parallel algorithms? As it takes place nearly everyone who implement algorithms wish to know how much of an individual resource (for example time

Based on your understanding of Unit 2, compile a set of five usability and/or user experience goals which you think will be useful in evaluating the two sites when gathering the in

Q. Explain XNOR gate with three input variable and draw necessary circuits. Q. Simplify FOLLOWING Using K-Map 1. m0 + m1 + m6 + m7 + m12 + m13 + m8 + m9 2. m0 + m2 + m4 +

Explain essential loop in Process Scheduling . The complex part of scheduling is to balance policy enforcement along with resource optimization so as to pick the best job to run

Granularity Granularity refers to the quantity of computation done in parallel relative to the dimension of the entire program. In parallel computing, granularity is a qualitat

Explain the uses of thumbwheels Two thumbwheels are usually required to control the screen cursor in its horizontal and vertical position respectively. As the name implies,

Specifying Optimisation Criteria Specify values to be minimized, maximized or optimized. You can understand it as way you normalize data in database. For instance, you should