An approach for code generation in the Sparse Polyhedral Framework

An approach for code generation in the Sparse Polyhedral Framework

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...

Full description

Bibliographic Details
Main Authors: Strout, Michelle Mills, LaMielle, Alan, Carter, Larry, Ferrante, Jeanne, Kreaseck, Barbara, Olschanowsky, Catherine
Other Authors: Computer Science Department, University of Arizona
Language:en
Published: ELSEVIER SCIENCE BV 2016
Subjects:
Inspector/executor strategies
Runtime reordering transformations
Sparse Polyhedral Framework
Online Access:http://hdl.handle.net/10150/615800
http://arizona.openrepository.com/arizona/handle/10150/615800

Internet

http://hdl.handle.net/10150/615800
http://arizona.openrepository.com/arizona/handle/10150/615800

Similar Items