Brief announcement: locality-enhancing loop transformations for tree traversal algorithms

Authors:
Youngjoon Jo;Milind Kulkarni
Affiliations:
Purdue University, West Lafayette, IN, USA;Purdue University, West Lafayette, IN, USA
Venue:
Proceedings of the twenty-third annual ACM symposium on Parallelism in algorithms and architectures
Year:
2011

Citing 4
Cited 0

Load balancing and data locality in adaptive hierarchical N-body methods: Barnes-Hut, fast multipole, and radiosity

Journal of Parallel and Distributed Computing
A Data Parallel Formulation of the Barnes-Hut Method for N -Body Simulations

PARA '00 Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia
Lightcuts: a scalable approach to illumination

ACM SIGGRAPH 2005 Papers
On fast Construction of SAH-based Bounding Volume Hierarchies

RT '07 Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we discuss transformations that can be applied to irregular programs that perform tree traversals, which can be seen as analogs of the popular regular transformations of loop tiling. We demonstrate the utility of these transformations on two tree traversal algorithms, the Barnes-Hut algorithm and raytracing, achieving speedups of up to 237% over the baseline implementation.