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 transformations. Experimental results indicate that the performance of automatically generated inspectors and executors competes with the performance of hand-written ones when further optimization is done.
| Identifer | oai:union.ndltd.org:arizona.edu/oai:arizona.openrepository.com:10150/615800 |
| Date | 04 1900 |
| Creators | Strout, Michelle Mills, LaMielle, Alan, Carter, Larry, Ferrante, Jeanne, Kreaseck, Barbara, Olschanowsky, Catherine |
| Contributors | Computer Science Department, University of Arizona |
| Publisher | ELSEVIER SCIENCE BV |
| Source Sets | University of Arizona |
| Language | English |
| Detected Language | English |
| Type | Article |
| Rights | Copyright © 2016 Elsevier B.V. All rights reserved. |
| Relation | http://linkinghub.elsevier.com/retrieve/pii/S0167819116000557 |
Page generated in 0.0019 seconds