data dependency

Instructions can be grouped together only if there is no data dependency between them.

An object's execution order is determined by object connections and the data dependency rule.

In a scoreboard, the data dependencies of every instruction are logged.

Understanding data dependency is fundamental in implementing parallel algorithms.

A major obstacle for vectorization is true data dependency shorter than the vector length.

Out-of-order execution where instructions execute in any order but without violating data dependencies.

It is difficult to analyze array references in compile time to determine data dependency (whether they point to same address or not).

A "data dependency problem he had explained to sinclaire.

This algorithm parallelizes poorly, due to a large number of data dependencies.

To further improve the performance the core utilized branch prediction and a number of techniques to resolve data dependency conflicts.

CPU hardware dynamically checks for data dependencies between instructions at run time.

It allows for multiple instructions to be dispatched at once regardless of the data dependencies between those instructions.

In compiler theory, the technique used to discover data dependencies among statements (or instructions) is called dependence analysis.

This in turn will highlight new data dependencies and new data items that should be considered for publication.

Instructions and their data dependencies proved to be too fine-grained to be effectively distributed in a large network.

The consequence is, that only applications with regular data dependencies can be implemented on classical systolic arrays.

One central problem for superscalar computer designers is the issue of "data dependency," the limit to the ability to make multiple instructions simultaneously.

Designs that use conventional memory addresses as data dependency tags are called static dataflow machines.

The purpose of interleaved multithreading is to remove all data dependency stalls from the execution pipeline.

With phasers it is possible to express data dependencies between the participating processes explicitly to avoid unnecessary over-synchronization.

Out-of-order execution somewhat rearranges the order in which instructions are executed to reduce delays due to data dependencies.

This way, so called data dependencies (WAR - Write after Read) can be addressed.

The Chase is a simple fixpoint algorithm testing and enforcing implication of data dependencies in database systems.

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

Wang and Kumar proposed the document-driven workflow systems which is designed based on data dependencies without the need for explicit control flows.