Data flow graphs: system specification with the most unrestricted semantics

Abstract

A new data flow graph concept is defined to be used for architectural synthesis as well as verification of a system. The graph contains only the explicit data dependencies, but any other constraints can also be described. The semantics of this graph does not impose any restriction on the scheduler, except for the explicit data dependencies. For instance, the scheduler is not forced to work on certain blocks in the graph, like loop bodies but may work also across these borders. It is also proved that an optimal schedule can be found efficiently.<>