3. Principle of data-driven execution
3.1 Abstract syntax graph
Any logico-mathematical expression can be expressed in the form of a graph called an "abstract syntax graph", in which the nodes represent either input values or operators, and the arcs represent values transmitted from one node to another.
For example, the expression Z = (A x B) + C can be represented by the abstract syntax graph in figure 4 .
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Principle of data-driven execution
Components of "restricted data flow" execution
Bibliography
Exclusive to subscribers. 97% yet to be discovered!
Already subscribed? Log in!
Article included in this offer
"Software technologies and System architectures"
(
234 articles
)
Updated and enriched with articles validated by our scientific committees
A set of exclusive tools to complement the resources
