EE382C Embedded Software Systems
Dynamic Scheduling of Dataflow Graphs

Announcements

• TBA

Lecture

• Turing Machine (may only work under Netscape)
• Boolean Dataflow
• Common Execution Models for Dataflow (Notes)
• Tom Park's dissertation
  • Boolean Dataflow models from pages 27 and 28
  • Boolean Dataflow model on page 28 with an inverter on the Boolean line between the switch and select: select fires once, then an infinite build up of tokens
• Slides 1-9 Dynamic Scheduling Policies

Supplemental Material

• Superset of Synchronous and Boolean dataflow
• Add a wait port: enough data must be present on the wait port to be enabled. The minimum amount can change from firing to firing. Other ports obey Synchronous Dataflow semantics.
• The Boolean input for the Switch and Select Boolean Dataflow actors is a wait port of one token.
• Non-determinate merge - as soon as a token is available on either input, it is copied to the output

• Dataflow Processes (Notes), including discussion of a Fair Merge actor
• Proof Undecidability
• Compile Time Scheduling of Dynamic Constructs in Dataflow Program Graphs by Soonhoi Ha and Edward A. Lee