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 .

You do not have access to this resource.

Exclusive to subscribers. 97% yet to be discovered!

You do not have access to this resource.
Click here to request your free trial access!

Already subscribed? Log in!

The Ultimate Scientific and Technical Reference

A Comprehensive Knowledge Base, with over 1,200 authors and 100 scientific advisors

+ More than 10,000 articles and 1,000 how-to sheets, over 800 new or updated articles every year

From design to prototyping, right through to industrialization, the reference for securing the development of your industrial projects

This article is included in

Software technologies and System architectures

This offer includes:

Knowledge Base

Updated and enriched with articles validated by our scientific committees

Services

A set of exclusive tools to complement the resources

Practical Path

Operational and didactic, to guarantee the acquisition of transversal skills

Doc & Quiz

Interactive articles with quizzes, for constructive reading

Subscribe now!

Ongoing reading
Principle of data-driven execution

Previous
page A brief history of the "restricted data stream" concept

Components of "restricted data flow" execution

Bibliography

(1) - THORNTON (J.) - Design of a Computer. - The Control Data 6600.
(2) - TOMASULO (R.M.) - An efficient algorithm for exploiting multiple arithmetic unit. - IBM Journal Research and Development, pp. 25-33 (January 1967).