Loop transformations for interface-based hierarchies IN SDF graphs

Data-flow has proven to be an attractive computation model for programming digital signal processing (DSP) applications. A restricted version of data-flow, termed synchronous data-flow (SDF), offers strong compile-time predictability properties, but has limited expressive power. A new type of hierarchy (Interface-based SDF) has been proposed allowing more expressivity while maintaining its predictability. One of the main problems with this hierarchical SDF model is the lack of trade-off between parallelism and network clustering. This paper presents a systematic method for applying an important class of loop transformation techniques in the context of interface-based SDF semantics.The resulting approach provides novel capabilities for integrating parallelism extraction properties of the targeted loop transformations with the useful modeling, analysis, and code reuse properties provided by SDF.

• Type: Conference
• Year: 2010
• Where: ASAP
• Authors: Jonathan Piat, Shuvra S. Bhattacharyya, Mickaël Raulet
• Keywords: ASAP 2010, Hardware, Hierarchical Sdf Model, Interface-based Sdf, Interface-based Sdf Semantics.The