The DOI matches its Crossref record; 19 of the 19 references it cites were found in a registry or an index.
Gunrock: a high-performance graph processing library on the GPU
Open accessAbstract
For large-scale graph analytics on the GPU, the irregularity of data access/control flow and the complexity of programming GPUs have been two significant challenges for developing a programmable high-performance graph library. "Gunrock," our high-level bulk-synchronous graph-processing system targeting the GPU, takes a new approach to abstracting GPU graph analytics: rather than designing an abstraction around computation, Gunrock instead implements a novel data-centric abstraction centered on operations on a vertex or edge frontier. Gunrock achieves a balance between performance and expressiveness by coupling high-performance GPU computing primitives and optimization strategies with a high-level programming model that allows programmers to quickly develop new graph primitives with small code size and minimal GPU programming knowledge. We evaluate Gunrock on five graph primitives (BFS, BC, SSSP, CC, and PageRank) and show that Gunrock has on average at least an order of magnitude speedup over Boost and PowerGraph, comparable performance to the fastest GPU hardwired primitives, and better performance than any other GPU high-level graph library.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
Pregel: a system for large-scale graph processing
Malewicz, G., Austern, M. H., Bik, A. J. C., Dehnert, J. C., Horn, I., Leiser, N., & Czajkowski, G. (2010) · Proceedings of the 2010 ACM SIGMOD International Conference on Management of data · doi:10.1145/1807167.1807184 · Cited by 3,515
PowerGraph: distributed graph-parallel computation on natural graphs
Gonzalez, J. E., Low, Y., Gu, H., Bickson, D., & Guestrin, C. (2012) · doi:10.5555/2387880.2387883 · Cited by 1,451
Ligra: a lightweight graph processing framework for shared memory
Shun, J., & Blelloch, G. E. (2013) · Proceedings of the 18th ACM SIGPLAN symposium on Principles and practice of parallel programming · doi:10.1145/2442516.2442530 · Cited by 798
GPUs and the Future of Parallel Computing
Keckler, S. W., Dally, W. J., Khailany, B., Garland, M., & Glasco, D. (2011) · IEEE Micro · doi:10.1109/mm.2011.89 · Cited by 658
The Boost graph library : user guide and reference manual
Siek, J. G., Lee, L., & Lumsdaine, A. (2002) · CERN Document Server (European Organization for Nuclear Research) · Cited by 608
A lightweight infrastructure for graph analytics
Nguyen, D., Lenharth, A., & Pingali, K. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522739 · Cited by 579
A quantitative study of irregular programs on GPUs
Burtscher, M., Nasre, R., & Pingali, K. K. (2012) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2012.6402918 · Cited by 384
Direction-optimizing Breadth-First Search
Beamer, S., Asanovic, K., & Patterson, D. (2012) · 2012 International Conference for High Performance Computing, Networking, Storage and Analysis · doi:10.1109/sc.2012.50 · Cited by 325
The tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · ACM SIGPLAN Notices · doi:10.1145/1993316.1993501 · Cited by 312
Δ-stepping: a parallelizable shortest path algorithm
Meyer, U., & Sanders, P. (2003) · Journal of Algorithms · doi:10.1016/s0196-6774(03)00076-2 · Cited by 309
The tao of parallelism in algorithms
Pingali, K., Nguyen, D., Kulkarni, M., Burtscher, M., Hassaan, M. A., Kaleem, R., Lee, T.-H., Lenharth, A., Manevich, R., Méndez-Lojo, M., et al. (2011) · Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1993498.1993501 · Cited by 234
PHAST: Hardware-accelerated shortest path trees
Delling, D., Goldberg, A. V., Nowatzyk, A. G., & Werneck, R. F. (2012) · Journal of Parallel and Distributed Computing · doi:10.1016/j.jpdc.2012.02.007 · Cited by 140
A performance evaluation of open source graph databases
McColl, R., Ediger, D., Poovey, J. A., Campbell, D., & Bader, D. A. (2014) · Workshop on Parallel Programming for Analytics Applications (PPAA) · doi:10.1145/2567634.2567638 · Cited by 99
A fast GPU algorithm for graph connectivity
Soman, J., Kothapalli, K., & Narayanan, P. J. (2010) · IEEE International Symposium on Parallel & Distributed Processing, Workshops and Phd Forum · doi:10.1109/ipdpsw.2010.5470817 · Cited by 99
Ligra: A Lightweight Graph Processing Framework for Shared Memory
Shun, J. (2017) · doi:10.1145/3018787.3018795 · Cited by 58
Performance Characterization of High-Level Programming Models for GPU Graph Analytics
Wu, Y., Wang, Y., Pan, Y., Yang, C., & Owens, J. D. (2015) · IEEE International Symposium on Workload Characterization · doi:10.1109/iiswc.2015.13 · Cited by 29
Self-citationFast Execution of Simultaneous Breadth-First Searches on Sparse Graphs
McLaughlin, A., & Bader, D. A. (2015) · IEEE International Conference on Parallel and Distributed Systems (ICPADS) · doi:10.1109/icpads.2015.10 · Cited by 17
WTF, GPU! computing twitter's who-to-follow on the GPU
Geil, A., Wang, Y., & Owens, J. D. (2014) · doi:10.1145/2660460.2660481 · Cited by 11
Self-citation
Cited by
Computing Graph Neural Networks: A Survey from Algorithms to Accelerators
Abadal, S., Jain, A., Guirado, R., López-Alonso, J., & Alarcón, E. (2022) · ACM Computing Surveys · doi:10.1145/3477141 · Cited by 285
Graphicionado: A high-performance and energy-efficient accelerator for graph analytics
Ham, T. J., Wu, L., Sundaram, N., Satish, N., & Martonosi, M. (2016) · 2016 49th Annual IEEE/ACM International Symposium on Microarchitecture (MICRO) · doi:10.1109/micro.2016.7783759 · Cited by 277
A Ubiquitous Machine Learning Accelerator with Automatic Parallelization on FPGA
Wang, C., Gong, L., Li, X., & Zhou, X. (2020) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2020.2990924 · Cited by 37
“For the application acceleration, there have been GPU-based acceleration engines for DNN [23], and graph processing [24].”
Method
Metadata
- Authors
- Wang, Y., Davidson, A., Pan, Y., Wu, Y., Riffel, A., & Owens, J. D.
- Venue
- Proceedings of the 21st ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
- Publisher
- ACM
- Published
- 2016-02-27
- Pages
- 1-12
- OpenAlex
- W2951135776
- Cited by
- 338
- References
- 19
- FWCI
- 10.92
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.