A GPU Implementation of Inclusion-based Points-to Analysis

Mario Mendez-Lojo, Martin Burtscher, Keshav Pingali
Institute for Computational Engineering and Sciences, University of Texas, Austin, US
17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 2012


   title={A GPU Implementation of Inclusion-based Points-to Analysis},

   author={Mendez-Lojo, Mario and Burtscher, Martin and Pingali, Keshav},

   booktitle={17th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming},



Graphics Processing Units (GPUs) have emerged as powerful accelerators for many regular algorithms that operate on dense arrays and matrices. In contrast, we know relatively little about using GPUs to accelerate highly irregular algorithms that operate on pointer-based data structures such as graphs. For the most part, research has focused on GPU implementations of graph analysis algorithms that do not modify the structure of the graph, such as algorithms for breadth-first search and strongly-connected components. In this paper, we describe a high-performance GPU implementation of an important graph algorithm used in compilers such as gcc and LLVM: Andersen-style inclusion-based points-to analysis. This algorithm is challenging to parallelize effectively on GPUs because it makes extensive modifications to the structure of the underlying graph and performs relatively little computation. In spite of this, our program, when executed on a 14 Streaming Multiprocessor GPU, achieves an average speedup of 7x compared to a sequential CPU implementation and outperforms a parallel implementation of the same algorithm running on 16 CPU cores. Our implementation provides general insights into how to produce high-performance GPU implementations of graph algorithms, and it highlights key differences between optimizing parallel programs for multicore CPUs and for GPUs.
No votes yet.
Please wait...

* * *

* * *

HGPU group © 2010-2017 hgpu.org

All rights belong to the respective authors

Contact us: