On fusing recursive traversals of K-d trees - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2016

On fusing recursive traversals of K-d trees

Abstract

Loop fusion is a key program transformation for data locality optimization that is implemented in production compilers. But optimizing compilers for imperative languages currently cannot exploit fusion opportunities across a set of recursive tree traversal computations with producer-consumer relationships. In this paper, we develop a compile-time approach to dependence characterization and program transformation to enable fusion across recursively specified traversals over k-d trees. We present the FuseT source-to-source code transformation framework to automatically generate fused composite recursive operators from an input program containing a sequence of primitive recursive operators. We use our framework to implement fused operators for MADNESS, Multiresolution Adaptive Numerical Environment for Scientific Simulation. We show that locality optimization through fusion can offer significant performance improvement.
No file

Dates and versions

hal-01335355 , version 1 (21-06-2016)

Identifiers

  • HAL Id : hal-01335355 , version 1

Cite

Rajbhandari Samyam, Kim Jinsung, Sriram Krishnamoorthy, Louis-Noël Pouchet, Fabrice Rastello, et al.. On fusing recursive traversals of K-d trees. Proceedings of the 25th International Conference on Compiler Construction, CC 2016, Mar 2016, Barcelona, Spain. ⟨hal-01335355⟩
154 View
0 Download

Share

Gmail Facebook X LinkedIn More