An approach for code generation in the sparse polyhedral framework
MM Strout, A LaMielle, L Carter, J Ferrante…�- Parallel Computing, 2016 - Elsevier
Applications that manipulate sparse data structures contain memory reference patterns that
are unknown at compile time due to indirect accesses such as A [B [i]]. To exploit parallelism
and improve locality in such applications, prior work has developed a number of Run-Time
Reordering Transformations (RTRTs). This paper presents the Sparse Polyhedral
Framework (SPF) for specifying RTRTs and compositions thereof and algorithms for
automatically generating efficient inspector and executor code to implement such�…
are unknown at compile time due to indirect accesses such as A [B [i]]. To exploit parallelism
and improve locality in such applications, prior work has developed a number of Run-Time
Reordering Transformations (RTRTs). This paper presents the Sparse Polyhedral
Framework (SPF) for specifying RTRTs and compositions thereof and algorithms for
automatically generating efficient inspector and executor code to implement such�…
Showing the best result for this search. See all results