Interface-Based Hierarchy for Synchronous Data-Flow Graphs

Jonathan Piat1,  Shuvra Bhattacharyya2,  MickaĆ«l Raulet1
1IETR/INSA, Rennes, France, 2Univ. Maryland, College Park, MD, USA


Abstract

Dataflow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of dataflow, termed synchronous dataflow (SDF), offers strong compile-time predictability properties, but has limited expressive power. In this paper we propose a new type of hierarchy in the SDF model allowing more expressivity while maintaining its predictability. This new hierarchy semantic is based on interfaces that fix the number of tokens consumed/produced by a hierarchical vertex in a manner that is independent or separate from the specified internal dataflow structure of the encapsulated subsystem. This interface-based hierarchy gives the application designer more flexibility to have an iterative approach, and to make optimizing choices at the designing level. This type of hierarchy is also closer to the code semantic as a hierarchy level can be interpreted as code closures, and allows to design iterative patterns.