research
∙
09/21/2023
Maximal Simplification of Polyhedral Reductions
Reductions combine multiple input values with an associative operator to...
share
research
∙
11/29/2022
Maximal Atomic irRedundant Sets: a Usage-based Dataflow Partitioning Algorithm
Programs admitting a polyhedral representation can be transformed in man...
research
∙
02/19/2022
Distributed non-negative RESCAL with Automatic Model Selection for Exascale Data
With the boom in the development of computer hardware and software, soci...
research
∙
02/11/2022
Increasing FPGA Accelerators Memory Bandwidth with a Burst-Friendly Memory Layout
Offloading compute-intensive kernels to hardware accelerators relies on ...
research
∙
10/06/2020
On Simplifying Dependent Polyhedral Reductions
Reductions combine collections of input values with an associative (and ...
research
∙
12/27/2019
LLOV: A Fast Static Data-Race Checker for OpenMP Programs
In the era of Exascale computing, writing efficient parallel programs is...
research
∙
02/05/2018
Analytical Cost Metrics : Days of Future Past
As we move towards the exascale era, the new architectures must be capab...
research
∙
02/01/2018
PCOT: Cache Oblivious Tiling of Polyhedral Programs
This paper studies two variants of tiling: iteration space tiling (or lo...
research
∙
12/13/2017
Accelerator Codesign as Non-Linear Optimization
We propose an optimization approach for determining both hardware and so...
research
∙
10/23/2016