The DOI matches its Crossref record; 23 of the 23 references it cites were found in a registry or an index.
GraphMat: high performance graph analytics made productive
Abstract
Given the growing importance of large-scale graph analytics, there is a need to improve the performance of graph analysis frameworks without compromising on productivity. GraphMat is our solution to bridge this gap between a user-friendly graph analytics framework and native, hand-optimized code. GraphMat functions by taking vertex programs and mapping them to high performance sparse matrix operations in the backend. We thus get the productivity benefits of a vertex programming framework without sacrificing performance. GraphMat is a single-node multicore graph framework written in C++ which has enabled us to write a diverse set of graph algorithms with the same effort compared to other vertex programming frameworks. GraphMat performs 1.1-7X faster than high performance frameworks such as GraphLab, CombBLAS and Galois. GraphMat also matches the performance of MapGraph, a GPU-based graph framework, despite running on a CPU platform with significantly lower compute and bandwidth resources. It achieves better multicore scalability (13-15X on 24 cores) than other frameworks and is 1.2X off native, hand-optimized code on a variety of graph algorithms. Since GraphMat performance depends mainly on a few scalable and well-understood sparse matrix operations, GraphMat can naturally benefit from the trend of increasing parallelism in future hardware.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Matrix Factorization Techniques for Recommender Systems
Koren, Y., Bell, R., & Volinsky, C. (2009) · Computer · doi:10.1109/mc.2009.263 · Cited by 11,673
What is Twitter, a social network or a news media?
Kwak, H., Lee, C., Park, H., & Moon, S. (2010) · Proceedings of the 19th international conference on World wide web · doi:10.1145/1772690.1772751 · Cited by 6,652
(2011) · Springer eBooks · doi:10.1007/978-0-387-85820-3 · Cited by 3,761
The university of Florida sparse matrix collection
Davis, T. A., & Hu, Y. (2011) · ACM Transactions on Mathematical Software · doi:10.1145/2049662.2049663 · Cited by 3,630
Introduction to Recommender Systems Handbook
Ricci, F., Rokach, L., & Shapira, B. (2011) · Recommender Systems Handbook · doi:10.1007/978-0-387-85820-3_1 · Cited by 2,378
Discovering regulatory and signalling circuits in molecular interaction networks
Ideker, T., Ozier, O., Schwikowski, B., & Siegel, A. F. (2002) · Bioinformatics · doi:10.1093/bioinformatics/18.suppl_1.s233 · Cited by 1,197
Bennett, J. R., & Lanning, S. (2007) · Cited by 1,134
User interactions in social networks and their implications
Wilson, C., Boe, B., Sala, A., Puttaswamy, K. P. N., & Zhao, B. Y. (2009) · Proceedings of the 4th ACM European conference on Computer systems · doi:10.1145/1519065.1519089 · Cited by 879
Defining and evaluating network communities based on ground-truth
Yang, J., & Leskovec, J. (2012) · Proceedings of the ACM SIGKDD Workshop on Mining Data Semantics · doi:10.1145/2350190.2350193 · Cited by 762
PEGASUS: A Peta-Scale Graph Mining System Implementation and Observations
Kang, U., Tsourakakis, C. E., & Faloutsos, C. (2009) · 2009 Ninth IEEE International Conference on Data Mining · doi:10.1109/icdm.2009.14 · Cited by 628
Xin, R., Gonzalez, J. E., Franklin, M. J. M., & Stoica, I. G. (2013) · doi:10.1145/2484425.2484427 · Cited by 581
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
The Combinatorial BLAS: design, implementation, and applications
Buluç, A., & Gilbert, J. R. (2011) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342011403516 · Cited by 415
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
Defining and Evaluating Network Communities Based on Ground-Truth
Yang, J., & Leskovec, J. (2012) · 2012 IEEE 12th International Conference on Data Mining · doi:10.1109/icdm.2012.138 · Cited by 254
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
Parallel Sparse Matrix-Matrix Multiplication and Indexing: Implementation and Experiments
Buluç, A., & Gilbert, J. R. (2012) · SIAM Journal on Scientific Computing · doi:10.1137/110848244 · Cited by 208
On the representation and multiplication of hypersparse matrices
Buluc, A., & Gilbert, J. R. (2008) · 2008 IEEE International Symposium on Parallel and Distributed Processing · doi:10.1109/ipdps.2008.4536313 · Cited by 201
Navigating the maze of graph analytics frameworks using massive graph datasets
Satish, N., Sundaram, N., Patwary, M. M. A., Seo, J., Park, J., Hassaan, M. A., Sengupta, S., Yin, Z., & Dubey, P. (2014) · Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data · doi:10.1145/2588555.2610518 · Cited by 176
Self-citationDistributed socialite: a datalog-based language for large-scale graph analysis
Seo, J., Park, J., Shin, J., & Lam, M. S. (2013) · Proceedings of the VLDB Endowment · doi:10.14778/2556549.2556572 · Cited by 137
SociaLite: Datalog extensions for efficient social network analysis
Seo, J., Guo, S. D., & Lam, M. S. (2013) · IEEE International Conference on Data Engineering (ICDE) · doi:10.1109/icde.2013.6544832 · Cited by 104
High-Level Strategies for Parallel Shared-Memory Sparse Matrix-Vector Multiplication
Yzelman, A.-J. N., & Roose, D. (2013) · IEEE Transactions on Parallel and Distributed Systems · doi:10.1109/tpds.2013.31 · Cited by 72
Graph analytics using vertica relational database
Jindal, A., Madden, S. R., Castellanos, M., & Hsu, M. (2015) · IEEE International Conference on Big Data (BigData) · doi:10.1109/bigdata.2015.7363873 · Cited by 33
Cited by
HyGCN: A GCN Accelerator with Hybrid Architecture
Yan, M., Deng, L., Hu, X., Liang, L., Feng, Y., Ye, X., Zhang, Z., Fan, D., & Xie, Y. (2020) · 2020 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca47549.2020.00012 · Cited by 335
OuterSPACE: An Outer Product Based Sparse Matrix Multiplication Accelerator
Pal, S., Beaumont, J., Park, D.-H., Amarnath, A., Feng, S., Chakrabarti, C., Kim, H.-S., Blaauw, D., Mudge, T., & Dreslinski, R. (2018) · 2018 IEEE International Symposium on High Performance Computer Architecture (HPCA) · doi:10.1109/hpca.2018.00067 · Cited by 292
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
Self-citation
Metadata
- Authors
- Sundaram, N., Satish, N., Patwary, M. M. A., Dulloor, S. R., Anderson, M. J., Vadlamudi, S. G., Das, D., & Dubey, P.
- Venue
- Proceedings of the VLDB Endowment
- Published
- 2015-07
- Volume
- 8
- Issue
- 11
- Pages
- 1214-1225
- ISSN
- 2150-8097 (ISSN-L)
- OpenAlex
- W1783256592
- Cited by
- 282
- References
- 23
- FWCI
- 24.55
- Type
- journal article
- Language
- en
- Open access
- closed
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.