Main Menu/
Search/
Help
Publications of the Ptolemy Group
CODE GENERATION BY USING INTEGER-CONTROLLED DATAFLOW GRAPH
Takashi Miyazaki and Edward A. Lee
Proc. of ICASSP '97, Munich, Germany, April 1997
![[Postscript]](http://ptolemy.eecs.berkeley.edu/papers/icons/Postscript.gif)
![[PDF]](http://ptolemy.eecs.berkeley.edu/papers/icons/PDF.gif)
ABSTRACT
Integer-Controlled Dataflow (IDF) and its code
generation applications in Ptolemy are presented. In IDF
graphs, which specify data processing systems, data token
flow is controlled by integer control tokens and states of
actors at run-time. The firing order of actors (schedule) is
determined at compile-time, however, the actors are
conditionally activated at run-time. This static schedule
contributes to effective simulation of systems. IDF supports
code generation. This enables code generation from
program graphs that include conditional jumps, loops and
repetitions, and greatly improves the practical usability of
the program synthesis in Ptolemy.
Send comments to Edward A. Lee at eal@eecs.berkeley.edu.