Explain the data dependency, Computer Engineering

Assignment Help:

Data Dependency

It indicates to the situation in which two or more instructions share same data. The instructions in a program are able to be arranged based on relationship of data dependency. It means how two segments or instructions are data dependent on each other. The subsequent types of data dependencies are identified:

i)  Output dependence: When output of the two instructions I1 and I2 overlap on same data, the instructions are said output dependent.  

ii) I/O dependence: When read and write operations by two instructions are invoked on the same file, it's the condition of I/O dependence.

iii) Flow dependence: If instruction I2 follows I1 and output of I1 becomes input of I2, then I2 is said to be flow dependent on I1

iv) Anti dependence: When instruction I2 follows instruction I1 such that output of instruction I2 overlaps with the input of instruction I1 on the same data.

Think about the subsequent program instructions:

I1: a = b

I2: c = a + d

I3: a = c

In this program segment instructions I1 and I2 are Flow dependent since variable a is produced by instruction I1 as output and used by instruction I2 as input. Instructions I2 and I3 are Anti dependent since variable a is produced by I3 but used by I2 and in sequence I2 comes first. I3 is flow dependent on I2 due to variable c. Instructions I3 and Instruction I1 are Output dependent since variable a is produced by both instructions.


Related Discussions:- Explain the data dependency

Define the bandwidth of a monitor, Q. Define the Bandwidth of a monitor? ...

Q. Define the Bandwidth of a monitor? Bandwidth is the amount of signal the monitor can handle and it is rated in MHz .This is the most usually quoted specification of a monito

Telematics, How are switching system classified

How are switching system classified

Specify the goals of parsing, Specify the goals of parsing. Goals: ...

Specify the goals of parsing. Goals: a. To check the validity of source string b. To agree on the syntactic structure of a source string. For invalid string this rep

State the optimal route of node, State the optimal route of node Consid...

State the optimal route of node Consider the node i which has path length K+1, with the directly preceding node on the path being j. The distance to node i is w(j, i) plus the

Evaluation function - canonical genetic algorithm, Evaluation function - ca...

Evaluation function - canonical genetic algorithm: However note that this termination check may be related or the same as the evaluation function - that discussed later - but

Explain about distributed shared memory systems, Explain about Distributed ...

Explain about Distributed Shared Memory Systems? Distributed Shared Memory (DSM) systems emulate a shared memory abstraction on loosely coupled architectures in order to allow

What is a spanning tree, What is a spanning Tree? A spanning tree is a ...

What is a spanning Tree? A spanning tree is a tree associated with a network. All the nodes of the graph appear on the tree once. A minimum spanning tree is a spanning tree

Describe about relationships and look up fields, Relationships are imported...

Relationships are imported from the source to finish without any hindrance but once they land in the destination they can never be changed or changed and change of extensions canno

Determine by which digits are represented in dtmf phone, In a DTMF phone, d...

In a DTMF phone, digits are represented by: (A)  Orthogonal frequencies. (B)  Orthogonal Phases. (C)  Orthogonal codes. (D)  Orthogonal pulses. Ans: Di

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