ABSTRACT
The techniques of the previous chapters apply compile time analysis to static schedules for application graphs that have no decision-making at the dataflow graph (inter-task) level. This chapter considers graphs with data-dependent control flow. Recall that atomic actors in an SDF graph are allowed to perform data-dependent decision making within their body, as long as their input/output behavior respects SDF semantics. We show how some of the ideas we explored previously can still be applied to dataflow graphs containing actors that display data-dependent firing patterns, and therefore are not SDF actors. We do this by studying OMA concepts in the context of the more general Boolean dataflow (BDF) model, which was reviewed in Section 4.7.1.
