The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
The Combinatorial BLAS: design, implementation, and applications
Abstract
This paper presents a scalable high-performance software library to be used for graph analysis and data mining. Large combinatorial graphs appear in many applications of high-performance computing, including computational biology, informatics, analytics, web search, dynamical systems, and sparse matrix methods. Graph computations are difficult to parallelize using traditional approaches due to their irregular nature and low operational intensity. Many graph computations, however, contain sufficient coarse-grained parallelism for thousands of processors, which can be uncovered by using the right primitives. We describe the parallel Combinatorial BLAS, which consists of a small but powerful set of linear algebra primitives specifically targeting graph and data mining applications. We provide an extensible library interface and some guiding principles for future development. The library is evaluated using two important graph algorithms, in terms of both performance and ease-of-use. The scalability and raw performance of the example applications, using the Combinatorial BLAS, are unprecedented on distributed memory clusters.
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
MapReduce: simplified data processing on large clusters
Dean, J., & Ghemawat, S. (2008) · Communications of the ACM · doi:10.1145/1327452.1327492 · Cited by 18,476
Iterative Methods for Sparse Linear Systems
Saad, Y. (2003) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898718003 · Cited by 13,790
A Set of Measures of Centrality Based on Betweenness
Freeman, L. C. (1977) · Sociometry · doi:10.2307/3033543 · Cited by 10,295
A faster algorithm for betweenness centrality*
Brandes, U. (2001) · The Journal of Mathematical Sociology · doi:10.1080/0022250x.2001.9990249 · Cited by 4,936
A Bridging Model for Parallel Computation
Valiant, L. G. (1990) · ACM eBooks · doi:10.1145/3749740.3749753 · Cited by 3,664
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
Efficient Management of Parallelism in Object-Oriented Numerical Software Libraries
Balay, S., Gropp, W. D., McInnes, L. C., & Smith, B. F. (1997) · Modern Software Tools for Scientific Computing · doi:10.1007/978-1-4612-1986-6_8 · Cited by 2,009
(2006) · Cited by 1,979
On understanding types, data abstraction, and polymorphism
Cardelli, L., & Wegner, P. (1985) · ACM Computing Surveys · doi:10.1145/6041.6042 · Cited by 1,669
Basic Linear Algebra Subprograms for Fortran Usage
Lawson, C. L., Hanson, R. J., Kincaid, D. R., & Krogh, F. T. (1979) · ACM Transactions on Mathematical Software · doi:10.1145/355841.355847 · Cited by 1,634
A Multigrid Tutorial, Second Edition
Briggs, W. L., Henson, V. E., & McCormick, S. F. (2000) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719505 · Cited by 1,510
Introduction to parallel computing: design and analysis of algorithms
Kumar, V., Grama, A. Y., Gupta, A., & Karypis, G. (1994) · Benjamin-Cummings Publishing Co., Inc. eBooks · Cited by 1,210
Templates for the Solution of Algebraic Eigenvalue Problems: A Practical Guide
Demmel, J. W., Dongarra, J. J., Ruhe, A., van der Vorst, H. A., & Bai, Z. (1987) · Medical Entomology and Zoology · Cited by 1,102
An overview of the Trilinos project
Heroux, M. A., Bartlett, R. A., Howle, V. E., Hoekstra, R. J., Hu, J. J., Kolda, T. G., Lehoucq, R. B., Long, K. R., Pawlowski, R. P., Phipps, E. T., et al. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1089014.1089021 · Cited by 1,048
Graph Clustering Via a Discrete Uncoupling Process
Van Dongen, S. (2008) · SIAM Journal on Matrix Analysis and Applications · doi:10.1137/040608635 · Cited by 750
Modern software tools for scientific computing
(1997) · Choice Reviews Online · doi:10.5860/choice.35-1575 · Cited by 510
The Case of the Missing Supercomputer Performance
Petrini, F., Kerbyson, D. J., & Pakin, S. (2003) · Proceedings - Supercomputing · doi:10.1145/1048935.1050204 · Cited by 494
Vector models for data-parallel computing
Blelloch, G. E. (1990) · Cited by 472
CHALLENGES IN PARALLEL GRAPH PROCESSING
LUMSDAINE, A., GREGOR, D., HENDRICKSON, B., & BERRY, J. (2007) · Parallel Processing Letters · doi:10.1142/s0129626407002843 · Cited by 469
Buluç, A., Fineman, J. T., Frigo, M., Gilbert, J. R., & Leiserson, C. E. (2009) · ACM Symposium on Parallelism in Algorithms and Architectures (SPAA) · doi:10.1145/1583991.1584053 · Cited by 430
Self-citationGraph Algorithms in the Language of Linear Algebra
(2011) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719918 · Cited by 398
Approximating Betweenness Centrality
Bader, D. A., Kintali, S., Madduri, K., & Mihail, M. (2007) · Lecture Notes in Computer Science · doi:10.1007/978-3-540-77004-6_10 · Cited by 340
Advances, Applications and Performance of the Global Arrays Shared Memory Programming Toolkit
Nieplocha, J., Palmer, B., Tipparaju, V., Krishnan, M., Trease, H., & Aprà, E. (2006) · The International Journal of High Performance Computing Applications · doi:10.1177/1094342006064503 · Cited by 325
(2013) · The Journal of Supercomputing · doi:10.1007/11227.1573-0484 · Cited by 276
Designing Multithreaded Algorithms for Breadth-First Search and st-connectivity on the Cray MTA-2
Bader, D. A., & Madduri, K. (2006) · 2006 International Conference on Parallel Processing (ICPP'06) · doi:10.1109/icpp.2006.34 · Cited by 216
Parallel Algorithms for Evaluating Centrality Indices in Real-world Networks
Bader, D. A., & Madduri, K. (2006) · 2006 International Conference on Parallel Processing (ICPP'06) · doi:10.1109/icpp.2006.57 · Cited by 202
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
Self-citationReview of "The boost graph library
Law, J. (2003) · ACM SIGSOFT Software Engineering Notes · doi:10.1145/638750.638764 · Cited by 171
Duff, I., Heroux, M. A., & Pozo, R. (2002) · ACM Transactions on Mathematical Software · doi:10.1145/567806.567810 · Cited by 163
Bader, D. A., & Madduri, K. (2008) · IEEE International Parallel and Distributed Processing Symposium (IPDPS) · doi:10.1109/ipdps.2008.4536261 · Cited by 141
Challenges and Advances in Parallel Sparse Matrix-Matrix Multiplication
Buluc, A., & Gilbert, J. R. (2008) · 2008 37th International Conference on Parallel Processing · doi:10.1109/icpp.2008.45 · Cited by 112
Self-citationA Unified Framework for Numerical and Combinatorial Computing
Gilbert, J. R., Reinhardt, S., & Shah, V. B. (2008) · Computing in Science & Engineering · doi:10.1109/mcse.2008.45 · Cited by 76
Self-citationA space-efficient parallel algorithm for computing betweenness centrality in distributed memory
Edmonds, N., Hoefler, T., & Lumsdaine, A. (2010) · IEEE International Conference on High Performance Computing, Data, and Analytics · doi:10.1109/hipc.2010.5713180 · Cited by 69
Highly Parallel Sparse Matrix-Matrix MultiplicationPreprint
Buluç, A., & Gilbert, J. R. (2010) · arXiv (Cornell University) · doi:10.48550/arxiv.1006.2183 · Cited by 27
Self-citationAnalysis and performance results of computing betweenness centrality on IBM Cyclops64
Tan, G., Sreedhar, V. C., & Gao, G. R. (2009) · The Journal of Supercomputing · doi:10.1007/s11227-009-0339-9 · Cited by 26
Sparse Matrices in Matlab*P: Design and Implementation
Shah, V. B., & Gilbert, J. R. (2004) · Lecture notes in computer science · doi:10.1007/978-3-540-30474-6_20 · Cited by 18
Self-citationLinear Algebraic Primitives for Parallel Computing on Large Graphs
Bárbara, S. (2010) · Cited by 3
Cited by
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
GPS: a graph processing system
Salihoglu, S., & Widom, J. (2013) · Proceedings of the 25th International Conference on Scientific and Statistical Database Management · doi:10.1145/2484838.2484843 · Cited by 510
Recent Advances in Graph Partitioning
Buluç, A., Meyerhenke, H., Safro, I., Sanders, P., & Schulz, C. (2016) · Lecture Notes in Computer Science · doi:10.1007/978-3-319-49487-6_4 · Cited by 482
Self-citationPowerLyra: differentiated graph computation and partitioning on skewed graphs
Chen, R., Shi, J., Chen, Y., & Chen, H. (2015) · Proceedings of the Tenth European Conference on Computer Systems · doi:10.1145/2741948.2741970 · Cited by 299
Metadata
- Authors
- Buluç, A., & Gilbert, J. R.
- Venue
- The International Journal of High Performance Computing Applications
- Publisher
- SAGE Publications
- Published
- 2011-05-19
- Volume
- 25
- Issue
- 4
- Pages
- 496-509
- ISSN
- 0890-2720 (ISSN-L)
- 1094-3420
- 1741-2846
- OpenAlex
- W2141380216
- Cited by
- 415
- References
- 37
- FWCI
- 25.53
- 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.