Data dependency

A data dependency in computer science is a situation in which a program statement (instruction) refers to the data of a preceding statement.

Uses your system voice; voice and rate in settings.

≈ 3 min read

Cite, export and learn8 citation formats · 8 exports · lesson and quiz

Names in other languages

No names in other languages are held for this entry yet.

Article bodies are English and are not machine-translated. A name in another language is not a translation of the article.

A data dependency in computer science is a situation in which a program statement (instruction) refers to the data of a preceding statement. In compiler theory, the technique used to discover data dependencies among statements (or instructions) is called dependence analysis. 1.

A = 3 2. B = A 3.

C = B Instruction 3 is truly dependent on instruction 2, as the final value of C depends on the instruction updating B. Instruction 2 is truly dependent on instruction 1, as the final value of B depends on the instruction updating A. Since instruction 3 is truly dependent upon instruction 2 and instruction 2 is truly dependent on instruction 1, instruction 3 is also truly dependent on instruction 1. Instruction level parallelism is therefore not an option in this example.

1. B = 3 2. A = B + 1 3.

B = 7 Example: MUL R3,R1,R2 ADD R2,R5,R6 It is clear that there is anti-dependence between these 2 instructions. At first we read R2 then in second instruction we are Writing a new value for it. An anti-dependency is an example of a name dependency.

That is, renaming of variables could remove the dependency, as in the next example: 1. B = 3 N. B2 = B 2. A = B2 + 1 3.

B = 7 A new variable, B2, has been declared as a copy of B in a new instruction, instruction N. The anti-dependency between 2 and 3 has been removed, meaning that these instructions may now be executed in parallel. Note that there is still a read-after-write dependency: instruction 2 is truly dependent on instruction N, which is truly dependent upon instruction 1.

This dependency existed in the original version, where instruction 2 was truly dependent on instruction 1. This dependency cannot be safely removed. 1.

B = 3 2. A = B + 1 3. B = 7 As with anti-dependencies, output dependencies are name dependencies.

That is, they may be removed through renaming of variables, as in the below modification of the above example: 1. B2 = 3 2. A = B2 + 1 3.

B = 7

Implications

Conventional programs are written assuming the sequential execution model. Under this model, instructions execute one after the other, atomically (i.e., at any given point in time, only one instruction is executed) and in the order specified by the program.

However, dependencies among statements or instructions may hinder parallelism — parallel execution of multiple instructions, either by a parallelizing compiler or by a processor exploiting instruction-level parallelism. Recklessly executing multiple instructions without considering related dependences may cause danger of getting wrong results, namely hazards.

Relevance in computing

Data dependencies are relevant in various areas of computing, particularly in processor design, compiler construction, parallel computing, and concurrent programming.

See also

Dependency analysis Control dependency Loop dependence analysis § Data dependence Hazard (computer architecture) § Data hazards

Text derived from https://en.wikipedia.org/w/index.php?oldid=1310777676 under CC BY-SA 4.0; modifications have been made.

Words in each sectionImplicationsImplicationsImplications: 83 words83See alsoSee alsoSee also: 35 words35Relevance in computingRelevance in computingRelevance in computing: 20 words20
Words in each section. Measured from the stored article body; sections below the minimum are not plotted.

Provenance

snapshot enwiki-001310777676 · captured 2025-09-11 · ledger · version history

Cite this page as: encyclopegia.org, “Data dependency”, snapshot enwiki-001310777676. https://encyclopegia.org/a/data-dependency

Sources cited in this revision

No external citation was extracted for this revision. That is a statement about the source, not a claim that none exists.