Throughput constrained parallelism reduction in cyclo-static dataflow applications

Sergiu Carpov 1 Loïc Cudennec 1 Renaud Sirdey 2
1 LIST - Laboratoire d'Intégration des Systèmes et des Technologies
2 Laboratoire des fondements des systèmes temps-réels embarqués
LIST - Laboratoire d'Intégration des Systèmes et des Technologies
Abstract : This paper deals with semantics-preserving parallelism reduction methods for cyclo-static dataflow applications. Parallelism reduction is the process of equivalent actors fusioning. The principal objectives of parallelism reduction are to decrease the memory footprint of an application and to increase its execution performance. We focus on parallelism reduction methodologies constrained by application throughput. A generic parallelism reduction methodology is introduced. Experimental results are provided for asserting the performance of the proposed method.
Document type :
Conference papers
Complete list of metadatas

Cited literature [12 references]  Display  Hide  Download
https://hal.inria.fr/hal-00832508
Contributor : Loïc Cudennec <>
Submitted on : Monday, June 10, 2013 - 6:26:12 PM
Last modification on : Friday, September 6, 2019 - 2:22:06 PM
Long-term archiving on : Wednesday, September 11, 2013 - 4:16:07 AM

File

iccs_2013_parallelism_reductio...
Files produced by the author(s)

Identifiers

Collections

CEA | DRT | LIST

Citation

Sergiu Carpov, Loïc Cudennec, Renaud Sirdey. Throughput constrained parallelism reduction in cyclo-static dataflow applications. International Conference on Computational Science (ICCS 2013), Jun 2013, Barcelona, Spain. pp.30-39, ⟨10.1016/j.procs.2013.05.166⟩. ⟨hal-00832508⟩

Export

BibTeX TEI DC DCterms EndNote

Share

Metrics

Record views

150

Files downloads

605

Contact


archive-ouverte@inria.fr