On Fusing Recursive Traversals of K-d Trees
Loop fusion is a key program transformation for data locality optimization that is implemented in production compilers. But optimizing compilers 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-ary 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 more than an order of magnitude performance improvement.
- Research Organization:
- Pacific Northwest National Lab. (PNNL), Richland, WA (United States)
- Sponsoring Organization:
- USDOE
- DOE Contract Number:
- AC05-76RL01830
- OSTI ID:
- 1253879
- Report Number(s):
- PNNL-SA-115709; KJ0402000
- Resource Relation:
- Conference: Proceedings of the 25th International Conference on Compiler Construction (CC 2016), March 12-18, 2016, Barcelona, Spain, 152-162
- Country of Publication:
- United States
- Language:
- English
Similar Records
Cache Locality Optimization for Recursive Programs
Techniques for the distributed implementation of recursive programs