2 citations · 4 across the 6 of their papers we have counts for
Showing 2018Show all
2 papers · 1 filter
cs.PL2018★ 1 cited
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…
cs.PL2018★ 1 cited
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.…