Parallelism Reduction Based on Pattern Substitution in Dataflow Oriented Programming Languages - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2012

Parallelism Reduction Based on Pattern Substitution in Dataflow Oriented Programming Languages

Abstract

In this paper, we present a compiler extension for applications targeting high performance embedded systems. It analyzes the graph of a dataflow application in order to adapt its parallelism degree. Our approach consists in the detection and the substitution of built-in patterns in the dataflow. Modifications applied on the graph do not alter the semantic of the application. A parallelism reduction engine is also described to perform an exhaustive search of the best reduction. Our proposition has been implemented within an industry-grade compiler for the Sigma-C dataflow language. It shows that for dataflow applications, the parallelism reduction extension helps the user focus on the algorithm by hiding all parallelism tuning considerations. Experimentations demonstrate the accuracy and the performance of the reduction engine for both synthetic and real applications.
Fichier principal
Vignette du fichier
cudsir_iccs2012.pdf (223.69 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

hal-00706943 , version 1 (13-06-2012)

Identifiers

Cite

Loïc Cudennec, Renaud Sirdey. Parallelism Reduction Based on Pattern Substitution in Dataflow Oriented Programming Languages. International Conference on Computational Science, ICCS 2012, University of Nebraska, Omaha, Jun 2012, Omaha, Nebraska, United States. pp.146-155, ⟨10.1016/j.procs.2012.04.016⟩. ⟨hal-00706943⟩
166 View
234 Download

Altmetric

Share

Gmail Facebook X LinkedIn More