Interface-based hierarchy for synchronous data-flow graphs

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 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.
Document type :
Conference papers
Complete list of metadatas

Cited literature [10 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-00440478
Contributor : Mickaël Raulet <>
Submitted on : Thursday, December 10, 2009 - 10:51:13 PM
Last modification on : Friday, November 16, 2018 - 1:24:39 AM
Long-term archiving on : Thursday, June 17, 2010 - 11:32:16 PM

File

sips2009.pdf
Files produced by the author(s)

Identifiers

Citation

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⟩

Share

Metrics

Record views

415

Files downloads

378