BPDF: Boolean Parametric Data Flow

Abstract : Dataflow programming models are well-suited to program many-core streaming applications. However, many streaming applications have a dynamic behavior. To capture this behavior, parametric dataflow models have been introduced over the years. Still, such models do not allow the topology of the dataflow graph to change at runtime, a feature that is also required to program modern streaming applications. To overcome these restrictions, we propose a new model of computation, the Boolean Parametric Data Flow (BPDF) model which combines integer parameters (to express dynamic rates) and boolean parameters (to express the activation and deactivation of communication channels). High dynamicity is provided by integer parameters which can change at each basic iteration and boolean parameters which can even change within the iteration. The major challenge with such dynamic models is to guarantee liveness and boundedness. We present static analyses which ensure statically the liveness and the boundedness of BDPF graphs. We also introduce a scheduling methodology to implement BPDF graphs on highly parallel platforms. Finally, we demonstrate our approach using a video decoder case study.
Document type :
Reports
Complete list of metadatas

Cited literature [16 references]  Display  Hide  Download

https://hal.inria.fr/hal-00846645
Contributor : Evangelos Bempelis <>
Submitted on : Friday, July 19, 2013 - 3:26:32 PM
Last modification on : Thursday, October 11, 2018 - 8:48:04 AM
Long-term archiving on : Wednesday, April 5, 2017 - 3:37:31 PM

File

RR-8333.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : hal-00846645, version 1

Citation

Vagelis Bebelis, Pascal Fradet, Alain Girault, Bruno Lavigueur. BPDF: Boolean Parametric Data Flow. [Research Report] RR-8333, INRIA. 2013, pp.21. ⟨hal-00846645⟩

Share

Metrics

Record views

386

Files downloads

405