HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation
Conference papers

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.
Complete list of metadata

Cited literature [20 references]  Display  Hide  Download

Contributor : Loïc Cudennec Connect in order to contact the contributor
Submitted on : Wednesday, June 13, 2012 - 2:01:37 PM
Last modification on : Thursday, February 17, 2022 - 10:08:04 AM
Long-term archiving on: : Friday, September 14, 2012 - 2:20:29 AM


Files produced by the author(s)





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⟩



Record views


Files downloads