Automatic vectorization of tree traversals

Parallel Architectures and Compilation Techniques - Conference Proceedings, PACT

Volumn , Issue , 2013, Pages 363-374

  Jo, Youngjoon ^a   Goldfarb, Michael ^a   Kulkarni, Milind ^a  

^a Purdue University   (United States)

Author keywords

automatic vectorization; irregular programs; SIMD; tree traversals

Indexed keywords

AUTOMATIC VECTORIZATION; COMMODITY PROCESSORS; DYNAMIC REORDERING; IRREGULAR PROGRAMS; LOCALITY TRANSFORMATIONS; SCIENTIFIC SIMULATIONS; SIMD; TREE TRAVERSAL;

ALGORITHMS; PARALLEL ARCHITECTURES;

FORESTRY;

ALGORITHMS; DATA PROCESSING; FORESTRY;

EID: 84887467173     PISSN: 1089795X     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/PACT.2013.6618832     Document Type: Conference Paper

References (25)

1. J. Barnes and P. Hut. A hierarchical o(nlogn) force-calculation algorithm. Nature, 324(4), 1986.
2. G. Barthe, J. M. Crespo, S. Gulwani, C. Kunz, and M. Marron. From relational verification to simd loop synthesis. In PPoPP, 2013.
3. J. L. Bentley. Multidimensional binary search trees used for associative searching. Commun. ACM, 18, 1975.
4. J. Chhugani, C. Kim, H. Shukla, J. Park, P. Dubey, J. Shalf, and H. D. Simon. Billion-particle simd-friendly two-point correlation on large-scale hpc cluster systems. In SC, 2012.
5. P. Christensen, J. Fong, D. Laur, and D. Batali. Ray tracing for the movie'cars'. In RT, 2006.
6. H. Dammertz, J. Hanika, and A. Keller. Shallow bounding volume hierarchies for fast simd ray tracing of incoherent rays. In EGSR, 2008.
7. A. Frank and A. Asuncion. UCI machine learning repository, 2010.
8. J. Havel and A. Herout. Yet faster ray-triangle intersection (using sse4). Visualization and Computer Graphics, IEEE Transactions on, 2010.
9. L. Hernquist. Vectorization of tree traversals. J. Comput. Phys., 87, 1990.
10. H. W. Jensen. Global illumination using photon maps. In Eurographics workshop on Rendering techniques, 1996.
11. Y. Jo and M. Kulkarni. Enhancing locality for recursive traversals of recursive structures. In OOPSLA, 2011.
12. Y. Jo and M. Kulkarni. Automatically enhancing locality for tree traversals with traversal splicing. In OOPSLA, 2012.
13. C. Kim, J. Chhugani, N. Satish, E. Sedlar, A. D. Nguyen, T. Kaldewey, V. W. Lee, S. A. Brandt, and P. Dubey. Fast: fast architecture sensitive tree search on modern cpus and gpus. In SIGMOD, 2010.
14. S. Kim and H. Han. Efficient simd code generation for irregular kernels. In PPoPP, 2012.
15. M. Kulkarni, M. Burtscher, K. Pingali, and C. Cascaval. Lonestar: A suite of parallel irregular programs. In ISPASS, 2009.
16. J. Makino. Vectorization of a treecode. J. Comput. Phys., 87, March 1990.
17. S. Maleki, Y. Gao, M. J. Garzarán, T. Wong, and D. A. Padua. An evaluation of vectorizing compilers. In PACT, 2011.
18. B. Moon, Y. Byun, T.-J. Kim, P. Claudio, H.-S. Kim, Y.-J. Ban, S. W. Nam, and S.-E. Yoon. Cache-oblivious ray reordering. ACM Trans. Graph., 29(3), 2010.
19. D. Nuzman and A. Zaks. Outer-loop vectorization: revisited for short simd architectures. In PACT, 2008.
20. B. Ren, G. Agrawal, J. R. Larus, T. Mytkowicz, T. Poutanen, and W. Schulte. Simd parallelization of applications that traverse irregular data structures. In CGO, 2013.
21. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. In POPL, 1999.
22. J. P. Singh, C. Holt, T. Totsuka, A. Gupta, and J. Hennessy. Load balancing and data locality in adaptive hierarchical n-body methods: Barnes-hut, fast multipole, and radiosity. J. Parallel Distrib. Comput., 27(2), 1995.
23. I. Wald, P. Slusallek, C. Benthin, and M. Wagner. Interactive rendering with coherent ray tracing. In Computer Graphics Forum, 2001.
24. T. Yamamuro, M. Onizuka, T. Hitaka, and M. Yamamuro. Vasttree: a vector-advanced and compressed structure for massive data tree traversal. In EDBT, 2012.
25. P. N. Yianilos. Data structures and algorithms for nearest neighbor search in general metric spaces. In SODA, 1993.