2 citations · 4 across the 6 of their papers we have counts for
6 papers
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…
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…
Increasing FPGA Accelerators Memory Bandwidth with a Burst-Friendly Memory Layout
Corentin Ferry, Tomofumi Yuki, Steven Derrien +1
Offloading compute-intensive kernels to hardware accelerators relies on the large degree of parallelism offered by these platforms. However, the effective bandwidth of the memory i…
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…
PCOT: Cache Oblivious Tiling of Polyhedral Programs
Waruna Ranasinghe, Nirmal Prajapati, Tomofumi Yuki +1
This paper studies two variants of tiling: iteration space tiling (or loop blocking) and cache-oblivious methods that recursively split the iteration space with divide-and-conquer.…
Checking Race Freedom of Clocked X10 Programs
Tomofumi Yuki, Paul Feautrier, Sanjay Rajopadhye +1
One of many approaches to better take advantage of parallelism, which has now become mainstream, is the introduction of parallel programming languages. However, parallelism is by n…