Bounded scheduling of process networks
Bounded scheduling of process networks
Digital Design with VERILOG HDL
Digital Design with VERILOG HDL
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Scheduling dynamic dataflow graphs with bounded memory using the token flow model
Multirate signal processing in Ptolemy
ICASSP '91 Proceedings of the Acoustics, Speech, and Signal Processing, 1991. ICASSP-91., 1991 International Conference
A dataflow specification for system level synthesis of 3D graphics applications
Proceedings of the 2001 Asia and South Pacific Design Automation Conference
A generalized static data flow clustering algorithm for mpsoc scheduling of multimedia applications
EMSOFT '08 Proceedings of the 8th ACM international conference on Embedded software
Novel collaborative automated testing framework using DDF
CDVE'07 Proceedings of the 4th international conference on Cooperative design, visualization, and engineering
Analysis of SystemC actor networks for efficient synthesis
ACM Transactions on Embedded Computing Systems (TECS)
Port Based Actor Model with Kahn Process Network Model and Decidable Dataflow Model
Journal of Signal Processing Systems
| Hi-index | 0.00 |
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.