Localizing Non-Affine Array References

Existing techniques can enhance the locality of arrays indexed by affine functions of induction variables. This paper presents a technique to localize non-affine array references, such as the indirect memory references common in sparse-matrix computations. Our optimization combines elements of tiling, data-centric tiling, data remapping and inspector-executor parallelization. We describe our technique, bucket tiling, which includes the tasks of permutation generation, data remapping, and loop regeneration. We show that profitability cannot generally be determined at compile-time, but requires an extension to run-time. We demonstrate our technique on three codes: integer sort, conjugate gradient, and a kernel used

• Type: Conference
• Year: 1999
• Where: IEEEPACT
• Authors: Nicholas Mitchell, Larry Carter, Jeanne Ferrante
• Keywords: Data-centric Tiling, Distributed And Parallel Computing, IEEEPACT 1999, Indirect Memory References, Non-affine Array References