Polyhedral Dataflow Programming: a Case Study - Archive ouverte HAL Access content directly
Conference Papers Year : 2018

Polyhedral Dataflow Programming: a Case Study

(1) , (2, 3, 4) , (5, 6)
1
2
3
4
5
6

Abstract

Dataflow languages expose the application's potential parallelism naturally and have thus been studied and developed for the past thirty years as a solution for harnessing the increasing hardware parallelism. However, when generating code for parallel processors, current dataflow compilers only take into consideration the overall dataflow network of the application. This leaves out the potential parallelism that could be extracted from the internals of agents, typically when those include loop nests, for instance, but also potential application of intra-agent pipelining, or task splitting and rescheduling. In this work, we study the benefits of jointly using polyhedral compilation with dataflow languages. More precisely, we propose to expend the parallelization of dataflow programs by taking into account the parallelism exposed by loop nests describing the internal behavior of the program's agents. This approach is validated through the development of a prototype toolchain based on an extended version of the ΣC language. We demonstrate the benefit of this approach and the potentiality of further improvements on relevant case studies.
Fichier principal
Vignette du fichier
finalversion_hal_sbacpad18_FGM.pdf (379.24 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

cea-01855997 , version 1 (09-08-2018)
cea-01855997 , version 2 (14-08-2018)

Identifiers

  • HAL Id : cea-01855997 , version 2

Cite

Romain Fontaine, Laure Gonnord, Lionel Morel. Polyhedral Dataflow Programming: a Case Study. SBAC-PAD 2018 - 30th International Symposium on Computer Architecture and High-Performance Computing, Sep 2018, Lyon, France. pp.1-9. ⟨cea-01855997v2⟩
480 View
694 Download

Share

Gmail Facebook Twitter LinkedIn More