Throughput constrained parallelism reduction in cyclo-static dataflow applications - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2013

Throughput constrained parallelism reduction in cyclo-static dataflow applications

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.
Fichier principal
Vignette du fichier
iccs_2013_parallelism_reduction.pdf (208.44 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00832508 , version 1 (10-06-2013)

Identifiers

Cite

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⟩
80 View
269 Download

Altmetric

Share

Gmail Facebook X LinkedIn More