Abstract

Data flow graph is a useful computational model to describe the functionality of a digital system. To execute a data flow graph on a target system, it should be synthesized to the code to be compiled on the target system. Current research activities on software synthesis are mainly focused on Synchronous Data Flow (SDF) graph, which can not represent the control structure of the application. On the other hand, Dynamic Data Flow (DDF) graph can express the control structure, such as conditionals and data dependent iterations. This paper synthesizes a C code for a DDF graph which includes not only the functions associated with the nodes of the graph, but also the run-time scheduler and the run-time buffer manager which can execute a DDF graph without deadlock with bounded memory requirement. In addition, this paper suggests hierarchical implementation of DDF which enhances the efficiency of run-time scheduling by clustering SDF type nodes as a specific macro node.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.