Interface-based hierarchy for synchronous data-flow graphs - Archive ouverte HAL Access content directly
Conference Papers Year : 2009

Interface-based hierarchy for synchronous data-flow graphs


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 domain 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 in iterative construction of hierarchical representations, and experimentation with different optimization choices at different levels of the design hierarchy.
Fichier principal
Vignette du fichier
sips2009.pdf (191.36 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00440478 , version 1 (10-12-2009)



Jonathan Piat, Shuvra S. Bhattacharyya, Mickaël Raulet. Interface-based hierarchy for synchronous data-flow graphs. Signal Processing Systems, 2009. SiPS 2009. IEEE Workshop on, Oct 2009, Tampere, Finland. pp.145-150, ⟨10.1109/SIPS.2009.5336240⟩. ⟨hal-00440478⟩
218 View
443 Download



Gmail Facebook Twitter LinkedIn More