Efficient resolution of sparse indirections in data-parallel compilers
- 1 January 1995
- proceedings article
- Published by Association for Computing Machinery (ACM)
- p. 117-126
- https://doi.org/10.1145/224538.224551
Abstract
This paper describes new compiler and run-time techniquesto handle array accesses involving several levels of indirectionsuch as those arising in sparse and irregular problems.The lack of information at compile-time in such problemshas typically required the insertion of expensive runtimesupport. We propose new data distributions which can beused with standard sparse matrix representations to achievemuch more efficient resolution of indirections at runtime.Unlike previous methods, our...Keywords
This publication has 0 references indexed in Scilit: