The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
High-performance implementation of the level-3 BLAS
Abstract
A simple but highly effective approach for transforming high-performance implementations on cache-based architectures of matrix-matrix multiplication into implementations of other commonly used matrix-matrix computations (the level-3 BLAS) is presented. Exceptional performance is demonstrated on various architectures.
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
A set of level 3 basic linear algebra subprograms
Dongarra, J. J., Du Croz, J., Hammarling, S., & Duff, I. S. (1990) · ACM Transactions on Mathematical Software · doi:10.1145/77626.79170 · Cited by 1,821
Automatically Tuned Linear Algebra Software
Whaley, R. C., & Dongarra, J. J. (1998) · Conference on High Performance Computing (Supercomputing) · doi:10.5555/509058.509096 · Cited by 854
Anatomy of high-performance matrix multiplication
Goto, K., & Geijn, R. A. V. D. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1356052.1356053 · Cited by 753
Self-citationGunnels, J. A., Gustavson, F. G., Henry, G., & Geijn, R. A. (2001) · ACM Transactions on Mathematical Software · doi:10.1145/504210.504213 · Cited by 235
GEMM-based level 3 BLAS: high-performance model implementations and performance evaluation benchmark
Kågström, B., Ling, P., & van Loan, C. (1998) · ACM Transactions on Mathematical Software · doi:10.1145/292395.292412 · Cited by 204
LAPACK Users' guide (third ed.)
Anderson, E., Bai, Z., Bischof, C. H., Blackford, L. S., Demmel, J. W., Dongarra, J. J., Croz, J. D., Hammarling, S. J., Greenbaum, A. B., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · Cited by 178
Recursive Blocked Algorithms and Hybrid Data Structures for Dense Matrix Library Software
Elmroth, E., Gustavson, F., Jonsson, I., & Kågström, B. (2004) · SIAM Review · doi:10.1137/s0036144503428693 · Cited by 161
Department of Computer Sciences:
(2019) · Purdue University Press eBooks · doi:10.2307/j.ctv15wxp84.13 · Cited by 69
Cited by
Anatomy of high-performance matrix multiplication
Goto, K., & Geijn, R. A. V. D. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1356052.1356053 · Cited by 753
Self-citationAlgorithm 887: CHOLMOD, Supernodal Sparse Cholesky Factorization and Update/Downdate
Chen, Y., Davis, T. A., Hager, W. W., & Rajamanickam, S. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1391989.1391995 · Cited by 751
Large-scale deep unsupervised learning using graphics processors
Raina, R., Madhavan, A., & Ng, A. Y. (2009) · Proceedings of the 26th Annual International Conference on Machine Learning · doi:10.1145/1553374.1553486 · Cited by 742
A class of parallel tiled linear algebra algorithms for multicore architectures
Buttari, A., Langou, J., Kurzak, J., & Dongarra, J. (2009) · Parallel Computing · doi:10.1016/j.parco.2008.10.002 · Cited by 529
BLIS: A Framework for Rapidly Instantiating BLAS Functionality
Van Zee, F. G., & van de Geijn, R. A. (2015) · ACM Transactions on Mathematical Software · doi:10.1145/2764454 · Cited by 356
Self-citation
Metadata
- Authors
- Goto, K., & Van De Geijn, R.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2008-07-22
- Volume
- 35
- Issue
- 1
- Pages
- 1-14
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2084379367
- Cited by
- 312
- References
- 8
- FWCI
- 51.75
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: High-performance implementation of the level-3 BLAS. https://app.cochat.ai/papers/10.1145/1377603.1377607
- The paper
- Goto, K., & Van De Geijn, R. (2008). High-performance implementation of the level-3 BLAS. ACM Transactions on Mathematical Software. https://doi.org/10.1145/1377603.1377607
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.