A GPU implementation of inclusion-based points-to analysis

Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPOPP

Volumn , Issue , 2012, Pages 107-116

  Méndez Lojo, Mario ^a   Burtscher, Martin ^b   Pingali, Keshav ^a,c  

^a UNIVERSITY OF TEXAS AT AUSTIN   (United States)

^b Texas State University   (United States)

^c University of Texas at Austin   (United States)

Author keywords

CUDA; GPU; Graph algorithms; Inclusion based points to analysis; Irregular programs

Indexed keywords

AS GRAPH; AVERAGE SPEED; BREADTH-FIRST SEARCH; CPU CORES; CUDA; DENSE ARRAYS; GPU; GPU IMPLEMENTATION; GRAPH ALGORITHMS; GRAPH ANALYSIS; GRAPHICS PROCESSING UNITS; MULTI CORE; PARALLEL IMPLEMENTATIONS; PARALLEL PROGRAM; POINTER-BASED DATA STRUCTURES; POINTS-TO ANALYSIS; UNDERLYING GRAPHS;

COMPUTER PROGRAMMING LANGUAGES; PARALLEL ARCHITECTURES; PARALLEL PROGRAMMING; PROGRAM PROCESSORS;

ALGORITHMS;

EID: 84858374841     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2145816.2145831     Document Type: Conference Paper

References (36)

1. NVIDIA's Next Generation CUDA Compute Architecture: Fermi. http://www.nvidia.com/content/PDF/fermi-white-papers/NVIDIA-Fermi-Compute- Architecture-Whitepaper.pdf, 2010.
2. CUDA C Programming Guide 4.0. NVIDIA, 2011.
3. L. O. Andersen. Program Analysis and Specialization for the C Programming Language. PhD thesis, DIKU, University of Copenhagen, May 1994. (DIKU report 94/19).
4. David A. Bader and Kamesh Madduri. Designing multithreaded algorithms for breadth-first search and st-connectivity on the cray mta- 2. In Proceedings of the 2006 International Conference on Parallel Processing, ICPP'06, pages 523-530, Washington, DC, USA, 2006. IEEE Computer Society. (Pubitemid 47159081)
5. J. Barnat, P. Bauch, L. Brim, and M. Češka. Computing Strongly Connected Components in Parallel on CUDA. In Proceedings of the 25th IEEE International Parallel & Distributed Processing Symposium (IPDPS'11), pages 541-552. IEEE Computer Society, 2011.
6. Marc Berndl, Ondrej Lhot́ak, Feng Qian, Laurie Hendren, and Navindra Umanee. Points-to analysis using BDDs. In Proc. Conf. on Programming Language Design and Implementation (PLDI), pages 103- 114, New York, NY, USA, 2003. ACM.
7. Ulrik Brandes and Thomas Erlebach, editors. Network Analysis: Methodological Foundations. Springer-Verlag, 2005.
8. Randal E. Bryant. Graph-based algorithms for boolean function manipulation. IEEE Transactions on Computers, 35:677-691, 1986.
9. Martin Burtscher and Keshav Pingali. An efficient CUDA implementation of the tree-based barnes hut n-body algorithm. In GPU Computing Gems Emerald Edition, pages 75-92. Morgan Kaufmann, 2011.
10. Shuai Che, Michael Boyer, Jiayuan Meng, David Tarjan, Jeremy W. Sheaffer, and Kevin Skadron. A performance study of general-purpose applications on graphics processors using cuda. J. Parallel Distrib. Comput., 68:1370-1380, October 2008.
11. L. Paul Chew. Guaranteed-quality mesh generation for curved surfaces. In Proc. Symp. on Computational Geometry (SCG), 1993.
12. Manuel Fähndrich, Jeffrey S. Foster, Zhendong Su, and Alexander Aiken. Partial online cycle elimination in inclusion constraint graphs. In Proc. Conf. on Programming Language Design and Implementation (PLDI), pages 85-96, New York, NY, USA, 1998. ACM. (Pubitemid 128454787)
13. Ben Hardekopf and Calvin Lin. The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. In Proc. Conf. on Programming Language Design and Implementation (PLDI), 2007.
14. Pawan Harish and P. J. Narayanan. Accelerating large graph algorithms on the gpu using cuda. In HiPC'07: Proceedings of the 14th international conference on High performance computing, pages 197- 208, Berlin, Heidelberg, 2007. Springer-Verlag.
15. Nevin Heintze and Olivier Tardieu. Ultra-fast aliasing analysis using cla: a million lines of c code in a second. SIGPLAN Not., 36(5):254- 263, 2001.
16. Fritz Henglein. Type inference and semi-unification. In Proceedings of the 1988 ACM conference on LISP and functional programming, LFP'88, pages 184-197, New York, NY, USA, 1988. ACM.
17. Michael Hind. Pointer analysis: haven't we solved this problem yet? In PASTE'01: Proceedings of the 2001 ACM SIGPLAN-SIGSOFT workshop on Program analysis for software tools and engineering, pages 54-61, New York, NY, USA, 2001. ACM. (Pubitemid 32861392)
18. Sungpack Hong, Sang Kyun Kim, Tayo Oguntebi, and Kunle Olukotun. Accelerating cuda graph algorithms at maximum warp. In Proceedings of the 16th ACM symposium on Principles and practice of parallel programming, PPoPP'11, pages 267-276, New York, NY, USA, 2011. ACM.
19. Sungpack Hong, Tayo Oguntebi, and Kunle Olukotun. Efficient parallel graph exploration on multi-core cpu and gpu. In 20th International Conference on Parallel Architectures and Compilation Techniques, PACT'11, 2011.
20. Song Huang, Shucai Xiao, and Wu chun Feng. On the energy efficiency of graphics processing units for scientific computing. In IPDPS, pages 1-8, 2009.
21. Milind Kulkarni, Keshav Pingali, Bruce Walter, Ganesh Ramanarayanan, Kavita Bala, and L. Paul Chew. Optimistic parallelism requires abstractions. SIGPLAN Not. (Proceedings of PLDI), 42(6):211- 222, 2007. (Pubitemid 47630689)
22. VictorW. Lee, Changkyu Kim, Jatin Chhugani, Michael Deisher, Daehyun Kim, Anthony D. Nguyen, Nadathur Satish, Mikhail Smelyanskiy, Srinivas Chennupaty, Per Hammarlund, Ronak Singhal, and Pradeep Dubey. Debunking the 100x gpu vs. cpu myth: an evaluation of throughput computing on cpu and gpu. In Proceedings of the 37th annual international symposium on Computer architecture, ISCA'10, pages 451-460, New York, NY, USA, 2010. ACM.
23. Ondřej Lhoták and Laurie Hendren. Scaling Java points-to analysis using Spark. In G. Hedin, editor, Compiler Construction, 12th International Conference, volume 2622 of LNCS, pages 153-169, Warsaw, Poland, April 2003. Springer.
24. Lijuan Luo, Martin Wong, and Wen-mei Hwu. An effective gpu implementation of breadth-first search. In Proceedings of the 47th Design Automation Conference, DAC'10, pages 52-55, New York, NY, USA, 2010. ACM.
25. Mario Méndez-Lojo, Augustine Mathew, and Keshav Pingali. Parallel inclusion-based points-to analysis. In Proceedings of the 24th Annual ACM SIGPLAN Conference on Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA'10), October 2010.
26. Duane G. Merrill, Michael Garland, and Andrew S. Grimshaw. Scalable gpu graph traversal. In 17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, PPoPP'12, 2012.
27. Donald Nguyen and Keshav Pingali. Synthesizing concurrent schedulers for irregular algorithms. In ASPLOS'11: Proceedings of International Conference on Architectural Support for Programming Languages and Operating Systems, 2011.
28. NVIDIA. Thrust library version 1.4.0. http://code.google.com/p/thrust/.
29. Keshav Pingali, Donald Nguyen, Milind Kulkarni, Martin Burtscher, M. Amber Hassaan, Rashid Kaleem, Tsung-Hsien Lee, Andrew Lenharth, Roman Manevich, Mario Méndez-Lojo, Dimitrios Prountzos, and Xin Sui. The tao of parallelism in algorithms. In Proceedings of the 32nd ACM SIGPLAN conference on Programming language design and implementation, PLDI'11, pages 12-25, New York, NY, USA, 2011. ACM.
30. Tarun Prabhu, Shreyas Ramalingam, Matthew Might, and Mary Hall. Eigencfa: accelerating flow analysis with gpus. In Proceedings of the 38th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages, POPL'11, pages 511-522, New York, NY, USA, 2011. ACM.
31. Thomas W. Reps. Program analysis via graph reachability. Technical Report Technical Report Number 1386, University of Wisconsin, 1998.
32. Atanas Rountev and Satish Chandra. Off-line variable substitution for scaling points-to analysis. In Proc. Conf. on Programming Language Design and Implementation (PLDI), pages 47-56, New York, NY, USA, 2000. ACM. (Pubitemid 32394082)
33. Bjarne Steensgaard. Points-to analysis in almost linear time. In POPL'96: Proceedings of the 23rd ACM SIGPLAN-SIGACT symposium on Principles of programming languages, pages 32-41, New York, NY, USA, 1996. ACM.
34. Richard Vuduc, Aparna Chandramowlishwaran, Jee Choi, Murat Guney, and Aashay Shringarpure. On the limits of gpu acceleration. In Proceedings of the 2nd USENIX conference on Hot topics in parallelism, HotPar'10, pages 13-13, Berkeley, CA, USA, 2010. USENIX Association.
35. John Whaley and Monica S. Lam. Cloning-based context-sensitive pointer alias analysis using binary decision diagrams. In Proc. Conf. on Programming Language Design and Implementation (PLDI), pages 131-144, New York, NY, USA, 2004. ACM.
36. Andy Yoo, Edmond Chow, Keith Henderson, William McLendon, Bruce Hendrickson, and Umit Catalyurek. A scalable distributed parallel breadth-first search algorithm on bluegene/l. In Proceedings of the 2005 ACM/IEEE conference on Supercomputing, SC'05, pages 25-, Washington, DC, USA, 2005. IEEE Computer Society.