Combining dataflow programming and polyhedral optimization, a case study - Archive ouverte HAL Access content directly
Reports (Technical Report) Year : 2017

Combining dataflow programming and polyhedral optimization, a case study

Abstract

Nowadays, parallel computers have become ubiquitous and current processors contain several execution cores, anywhere from a couple to hundreds. This multi-core tendency is due to constraints preventing the increase of clock frequencies, such as heat generation and power consumption. A variety of low-level tools exist to program these chips efficiently, but they are considered hard to program, to maintain, and to debug, because they may exhibit non-deterministic behaviors. This project focuses on adding an abstraction level in order to have as much performance as possible while not dealing with low-level mechanisms. The approach is based on data flow programming, which allows the programmer to specify only the operations to perform and their dependencies, without actually scheduling them. This project combines this paradigm with the Polyhedral Model, which allows automatic parallelization and optimization of loop nests, in order to make the programming easier by delegating work to the compilers and static analyzers.
Fichier principal
Vignette du fichier
RR-0490-dataflow-poly.pdf (1.09 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01572439 , version 1 (07-08-2017)

Licence

Attribution

Identifiers

  • HAL Id : hal-01572439 , version 1

Cite

Romain Fontaine, Lionel Morel, Laure Gonnord. Combining dataflow programming and polyhedral optimization, a case study. [Technical Report] RT-0490, Inria Rhône-Alpes; CITI - CITI Centre of Innovation in Telecommunications and Integration of services; LIP - ENS Lyon. 2017, pp.40. ⟨hal-01572439⟩
441 View
462 Download

Share

Gmail Facebook X LinkedIn More