Enhancing locality for recursive traversals of recursive structures

ACM SIGPLAN Notices

Volumn 46, Issue 10, 2011, Pages 463-482

  Jo, Youngjoon ^a   Kulkarni, Milind ^a  

^a Purdue University   (United States)

Author keywords

Irregular programs; Locality transformations; Tree traversals

Indexed keywords

AS GRAPH; AUTOTUNING TECHNIQUES; DATA REUSE; DENSE MATRICES; LOOP TRANSFORMATION; OPTIMIZATION FRAMEWORK; PERFORMANCE IMPROVEMENTS; POINTER-BASED DATA STRUCTURES; REAL-WORLD APPLICATION; RECURSIVE STRUCTURE; TEMPORAL LOCALITY; TRAVERSAL ALGORITHMS; TREE TRAVERSAL;

FORESTRY; OPTIMIZATION; TREES (MATHEMATICS);

LINEAR TRANSFORMATIONS;

ALGORITHMS; FORESTRY; OPTIMIZATION;

EID: 84858310773     PISSN: 15232867     EISSN: None     Source Type: Journal    
DOI: 10.1145/2076021.2048104     Document Type: Conference Paper

References (37)

1. S. Aluru, J. Gustafson, G. M. Prabhu, and F. E. Sevilgen. Distribution-independent hierarchical algorithms for the nbody problem. J. Supercomput., 12:303-323, October 1998.
2. M. Amor, F. Argüello, J. López, O. G. Plata, and E. L. Zapata. A data parallel formulation of the barnes-hut method for n -body simulations. In Proceedings of the 5th International Workshop on Applied Parallel Computing, New Paradigms for HPC in Industry and Academia, PARA '00, pages 342-349, London, UK, 2001. Springer-Verlag. (Pubitemid 33239315)
3. J. Barnes and P. Hut. A hierarchical o(nlogn) forcecalculation algorithm. Nature, 324(4):446-449, December 1986.
4. T. M. Chilimbi, B. Davidson, and J. R. Larus. Cacheconscious structure definition. In Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, PLDI '99, pages 13-24, New York, NY, USA, 1999. ACM.
5. T. M. Chilimbi, M. D. Hill, and J. R. Larus. Cache-conscious structure layout. In Proceedings of the ACM SIGPLAN 1999 conference on Programming language design and implementation, PLDI '99, pages 1-12, New York, NY, USA, 1999. ACM.
6. T. M. Chilimbi and J. R. Larus. Using generational garbage collection to implement cache-conscious data placement. In Proceedings of the 1st international symposium on Memory management, ISMM '98, pages 37-48, New York, NY, USA, 1998. ACM. (Pubitemid 129686058)
7. T. Ekman and G. Hedin. The jastadd extensible java compiler. In Proceedings of the 22nd annual ACM SIGPLAN conference on Object-oriented programming systems and applications, OOPSLA '07, pages 1-18, New York, NY, USA, 2007. ACM.
8. G. C. Fox. A graphical approach to load balancing and sparse matrix vector multiplication on the hypercube. Institute for Mathematics and Its Applications, 13:37-+, 1988.
9. M. Frigo, C. E. Leiserson, and K. H. Randall. The implementation of the cilk-5 multithreaded language. SIGPLAN Not., 33(5):212-223, 1998. (Pubitemid 128454798)
10. R. Ghiya, L. Hendren, and Y. Zhu. Detecting parallelism in c programs with recursive data structures. IEEE Transactions on Parallel and Distributed Systems, 1:35-47, 1998.
11. R. Ghiya and L. J. Hendren. Is it a tree, a dag, or a cyclic graph? a shape analysis for heap-directed pointers in c. In POPL '96: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 1-15, New York, NY, USA, 1996. ACM.
12. A. G. Gray and A.W. Moore. N-Body Problems in Statistical Learning. In T. K. Leen, T. G. Dietterich, and V. Tresp, editors, Advances in Neural Information Processing Systems (NIPS) 13 (Dec 2000). MIT Press, 2001.
13. T. Hamada, T. Narumi, R. Yokota, K. Yasuoka, K. Nitadori, and M. Taiji. 42 tflops hierarchical n-body simulations on gpus with applications in both astrophysics and turbulence. In SC '09: Proceedings of the Conference on High Performance Computing Networking, Storage and Analysis, pages 1-12, New York, NY, USA, 2009. ACM.
14. H. Han and C.-W. Tseng. Exploiting locality for irregular scientific codes. IEEE Trans. Parallel Distrib. Syst., 17:606-618, July 2006. (Pubitemid 43997184)
15. L. Hernquist. Vectorization of tree traversals. J. Comput. Phys., 87:137-147, March 1990.
16. K. Kennedy and J. Allen, editors. Optimizing compilers for modren architectures:a dependence-based approach. Morgan Kaufmann, 2001.
17. M. Kulkarni, M. Burtscher, K. Pingali, and C. Cascaval. Lonestar: A suite of parallel irregular programs. In 2009 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS), pages 65-76, April 2009.
18. M. Kulkarni, K. Pingali, B. Walter, G. Ramanarayanan, K. Bala, and L. P. Chew. Optimistic parallelism requires abstractions. SIGPLAN Not. (Proceedings of PLDI 2007), 42(6):211-222, 2007. (Pubitemid 47630689)
19. M. H. L. Nyland and J. Prins. Fast n-body simulation with cuda. GPU Gems, (3):677-695, 2007.
20. C. Lattner and V. Adve. Automatic pool allocation: improving performance by controlling data structure layout in the heap. In Proceedings of the 2005 ACM SIGPLAN conference on Programming language design and implementation, PLDI '05, pages 129-142, New York, NY, USA, 2005. ACM.
21. J. Makino. Vectorization of a treecode. J. Comput. Phys., 87:148-160, March 1990.
22. E. Mansson, J. Munkberg, and T. Akenine-Moller. Deep coherent ray tracing. In Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing, pages 79-85, Washington, DC, USA, 2007. IEEE Computer Society.
23. J. Mellor-Crummey, D. Whalley, and K. Kennedy. Improving memory hierarchy performance for irregular applications using data and computation reorderings. Int. J. Parallel Program., 29(3):217-247, 2001. (Pubitemid 33818435)
24. M. Pharr, C. Kolb, R. Gershbein, and P. Hanrahan. Rendering complex scenes with memory-coherent ray tracing. In Proceedings of the 24th annual conference on Computer graphics and interactive techniques, SIGGRAPH '97, pages 101-108, New York, NY, USA, 1997. ACMPress/Addison-Wesley Publishing Co.
25. K. Pingali, M. Kulkarni, D. Nguyen, M. Burtscher, M. Mendez-Lojo, D. Prountzos, X. Sui, and Z. Zhong. Amorphous data-parallelism in irregular algorithms. Technical Report TR-09-05, Department of Computer Science, The University of Texas at Austin, February 2009.
26. M. Rinard and P. C. Diniz. Commutativity analysis: a new analysis technique for parallelizing compilers. ACM Trans. Program. Lang. Syst., 19(6):942-991, 1997. (Pubitemid 127455640)
27. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM Transactions on Programming Languages and Systems, 24(3), May 2002.
28. J. K. Salmon. Parallel hierarchical N-body methods. PhD thesis, Pasadena, CA, USA, 1991.
29. J. P. Singh, C. Holt, T. Totsuka, A. Gupta, and J. Hennessy. Load balancing and data locality in adaptive hierarchical nbody methods: Barnes-hut, fast multipole, and radiosity. J. Parallel Distrib. Comput., 27(2):118-141, 1995.
30. S. Thees and C. Weiland. Implementing lightcuts. Technical report, Fachhochschule Bonn-Rhein-Sieg, University of Applied Sciences, Fachbereich Informatik, July 2008.
31. A. Tiwari, C. Chen, J. Chame, M. Hall, and J. K. Hollingsworth. A scalable auto-tuning framework for compiler optimization. In IPDPS '09: Proceedings of the 2009 IEEE International Symposium on Parallel&Distributed Processing, pages 1-12, Washington, DC, USA, 2009. IEEE Computer Society.
32. D. N. Truong, F. Bodin, and A. Seznec. Improving cache behavior of dynamically allocated data structures. In Proceedings of the 1998 International Conference on Parallel Architectures and Compilation Techniques, PACT '98, pages 322-, Washington, DC, USA, 1998. IEEE Computer Society.
33. R. Vuduc, J.W. Demmel, and K. A. Yelick. Oski: A library of automatically tuned sparse matrix kernels. Journal of Physics: Conference Series, 16(1), 2005.
34. I. Wald. On fast construction of sah-based bounding volume hierarchies. In RT '07: Proceedings of the 2007 IEEE Symposium on Interactive Ray Tracing, pages 33-40, Washington, DC, USA, 2007. IEEE Computer Society.
35. B. Walter, K. Bala, M. Kulkarni, and K. Pingali. Fast agglomerative clustering for rendering. In IEEE Symposium on Interactive Ray Tracing (RT), pages 81-86, August 2008.
36. B.Walter, S. Fernandez, A. Arbree, K. Bala, M. Donikian, and D. Greenberg. Lightcuts: a scalable approach to illumination. ACM Transactions on Graphics (SIGGRAPH), 24(3):1098-1107, July 2005.
37. C. Whaley, A. Petitet, and J. J. Dongarra. Automated empirical optimization of software and the atlas project. Parallel Computing, 27:2001, 2000.