Showing cs.PLShow all
3 papers · 1 filter
cs.PL2024
Simplification of Polyhedral Reductions in Practice
Louis Narmour, Ryan Job, Tomofumi Yuki +1
Reductions combine collections of inputs with an associative (and here, also commutative) operator to produce collections of outputs. When the same value contributes to multiple ou…
cs.PL2023
Maximal Simplification of Polyhedral Reductions
Louis Narmour, Tomofumi Yuki, Sanjay Rajopadhye
Reductions combine collections of input values with an associative and often commutative operator to produce collections of results. When the same input value contributes to multip…
cs.PL2018
Sparse Matrix Code Dependence Analysis Simplification at Compile Time
Mahdi Soltan Mohammadi, Kazem Cheshmi, Ganesh Gopalakrishnan +5
Analyzing array-based computations to determine data dependences is useful for many applications including automatic parallelization, race detection, computation and communication…