1 citations · 2 across the 4 of their papers we have counts for
Showing cs.PLShow all
3 papers · 1 filter
cs.PL2022
Maximal Atomic irRedundant Sets: a Usage-based Dataflow Partitioning Algorithm
Corentin Ferry, Steven Derrien, Sanjay Rajopadhye
Programs admitting a polyhedral representation can be transformed in many ways for locality and parallelism, notably loop tiling. Data flow analysis can then compute dependence rel…
cs.PL2020
On Simplifying Dependent Polyhedral Reductions
Sanjay Rajopadhye
\emph{Reductions} combine collections of input values with an associative (and usually also commutative) operator to produce either a single, or a collection of outputs. They are u…
cs.PL2019
LLOV: A Fast Static Data-Race Checker for OpenMP Programs
Utpal Bora, Santanu Das, Pankaj Kukreja +3
In the era of Exascale computing, writing efficient parallel programs is indispensable and at the same time, writing sound parallel programs is very difficult. Specifying paralleli…