data flow

Computing Dictionary

data flow definition

architecture
A data flow architecture or language performs a computation when all the operands are available. Data flow is one kind of data driven architecture, the other is demand driven. It is a technique for specifying parallel computation at a fine-grain level, usually in the form of two-dimensional graphs in which instructions that are available for concurrent execution are written alongside each other while those that must be executed in sequence are written one under the other. Data dependencies between instructions are indicated by directed arcs. Instructions do not reference memory since the data dependence arcs allow data to be transmitted directly from the producing instruction to the consuming one.
Data flow schemes differ chiefly in the way that they handle re-entrant code. Static schemes disallow it, dynamic schemes use either "code copying" or "tagging" at every point of reentry.
An example of a data flow architecture is MIT's VAL machine.

The Free On-line Dictionary of Computing, © Denis Howe 2010 http://foldoc.org
Cite This Source
Explore Dictionary.com
Previous Definition: data file
Next Definition: data flow analysis
Words Near: data flow
More from Thesaurus.com
Synonyms and Antonyms for data flow
More from Reference.com
Search for articles containing data flow
More from Dictionary.com Translator
Dictionary.com Word FAQs

Dictionary.com presents 366 FAQs, incorporating some of the frequently asked questions from the past with newer queries.

Copyright © 2014 Dictionary.com, LLC. All rights reserved.
  • Please Login or Sign Up to use the Recent Searches feature