Loop transformations for interface-based hierarchies IN SDF graphs - Archive ouverte HAL Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Loop transformations for interface-based hierarchies IN SDF graphs

Résumé

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.
Fichier principal
Vignette du fichier
asap.pdf (124.94 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00560028 , version 1 (27-01-2011)

Identifiants

Citer

Jonathan Piat, Shuvra S. Bhattacharyya, Mickaël Raulet. Loop transformations for interface-based hierarchies IN SDF graphs. Application-specific Systems Architectures and Processors (ASAP), 2010 21st IEEE International Conference on, Jul 2010, Rennes, France. pp.341 -344, ⟨10.1109/ASAP.2010.5540954⟩. ⟨hal-00560028⟩
198 Consultations
170 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More