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.
Type de document :
Communication dans un congrès
International Conference on Computational Science (ICCS 2013), Jun 2013, Barcelona, Spain. 18, pp.30-39, 2013, Proceedings of the International Conference on Computational Science, ICCS 2013. <http://www.sciencedirect.com/science/article/pii/S1877050913003098>. <10.1016/j.procs.2013.05.166>
Liste complète des métadonnées


https://hal.inria.fr/hal-00832508
Contributeur : Loïc Cudennec <>
Soumis le : lundi 10 juin 2013 - 18:26:12
Dernière modification le : jeudi 9 février 2017 - 15:25:28
Document(s) archivé(s) le : mercredi 11 septembre 2013 - 04:16:07

Fichier

iccs_2013_parallelism_reductio...
Fichiers produits par l'(les) auteur(s)

Identifiants

Collections

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. 18, pp.30-39, 2013, Proceedings of the International Conference on Computational Science, ICCS 2013. <http://www.sciencedirect.com/science/article/pii/S1877050913003098>. <10.1016/j.procs.2013.05.166>. <hal-00832508>

Partager

Métriques

Consultations de
la notice

81

Téléchargements du document

208