Classification and transformation of dynamic dataflow programs - Université de Rennes Accéder directement au contenu
Communication Dans Un Congrès Année : 2010

Classification and transformation of dynamic dataflow programs

Résumé

Dataflow programming has been used to describe signal processing applications for many years, traditionally with cyclostatic dataflow (CSDF) or synchronous dataflow (SDF) models that restrict expressive power in favor of compile-time analysis and predictability. Dynamic dataflow is not restricted with respect to expressive power, but it does require runtime scheduling in the general case. Fortunately, most signal processing applications are far from being entirely dynamic, and parts with static behavior need not be dynamically scheduled. This paper presents a method to automatically analyze and classify blocks of a dynamic dataflow program within more restrictive dataflow models when possible, and to transform the blocks classified as static to improve execution speed by reducing the number of FIFO accesses. We used this method on actors of two dynamic dataflow descriptions of an MPEG-4 part 2 decoder, and study how classification and transformation increases decoding speed.
Fichier principal
Vignette du fichier
PID1494215.pdf (233.46 Ko) Télécharger le fichier
Origine : Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-00565290 , version 1 (11-02-2011)

Identifiants

Citer

Matthieu Wipliez, Mickael Raulet. Classification and transformation of dynamic dataflow programs. Design and Architectures for Signal and Image Processing (DASIP), 2010 Conference on, 2010, United Kingdom. pp.303 -310, ⟨10.1109/DASIP.2010.5706280⟩. ⟨hal-00565290⟩
114 Consultations
249 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More