A Formal Definition of Data Flow Graph Models
IEEE Transactions on Computers
Petri Net Theory and the Modeling of Systems
Petri Net Theory and the Modeling of Systems
Data Structures and Algorithms
Data Structures and Algorithms
KIR—a graph-based model for description of mixed analog/digital systems
EURO-DAC '96/EURO-VHDL '96 Proceedings of the conference on European design automation
Graph based communication analysis for hardware/software codesign
CODES '99 Proceedings of the seventh international workshop on Hardware/software codesign
| Hi-index | 0.00 |
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.