The DOI matches its Crossref record; 1 of the 1 references it cites were found in a registry or an index.
GEMM-based level 3 BLAS: high-performance model implementations and performance evaluation benchmark
Abstract
The level 3 Basic Linear Algebra Subprograms (BLAS) are designed to perform various matrix multiply and triangular system solving computations. Due to the complex hardware organization of advanced computer architectures the development of optimal level 3 BLAS code is costly and time consuming. However, it is possible to develop a portable and high-performance level 3 BLAS library mainly relying on a highly optimized GEMM, the routine for the general matrix multiply and add operation. With suitable partitioning, all the other level 3 BLAS can be defined in terms of GEMM and a small amount of level 1 and level 2 computations. Our contribution is twofold. First, the model implementations in Fortran 77 of the GEMM-based level 3 BLAS are structured to reduced effectively data traffic in a memory hierarchy. Second, the GEMM-based level 3 BLAS performance evaluation benchmark is a tool for evaluating and comparing different implementations of the level 3 BLAS with the GEMM-based model implementations.
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
Gaussian elimination is not optimal
Strassen, V. (1969) · Numerische Mathematik · doi:10.1007/bf02165411 · Cited by 2,509
Cited by
Automated empirical optimizations of software and the ATLAS project
Clint Whaley, R., Petitet, A., & Dongarra, J. J. (2001) · Parallel Computing · doi:10.1016/s0167-8191(00)00087-9 · Cited by 1,317
An updated set of basic linear algebra subprograms (BLAS)
(2002) · ACM Transactions on Mathematical Software · doi:10.1145/567806.567807 · Cited by 834
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
CSDP, A C library for semidefinite programming
Borchers, B. (1999) · Optimization Methods and Software · doi:10.1080/10556789908805765 · Cited by 509
Towards dense linear algebra for hybrid GPU accelerated manycore systems
Tomov, S., Dongarra, J., & Baboulin, M. (2010) · Parallel Computing · doi:10.1016/j.parco.2009.12.005 · Cited by 451
Metadata
- Authors
- Kågström, B., Ling, P., & van Loan, C.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 1998-09
- Volume
- 24
- Issue
- 3
- Pages
- 268-302
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2079658918
- Cited by
- 204
- References
- 1
- FWCI
- 10.04
- 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: GEMM-based level 3 BLAS: high-performance model implementations and performance evaluation benchmark. https://app.cochat.ai/papers/10.1145/292395.292412
- The paper
- Kågström, B., Ling, P., & van Loan, C. (1998). GEMM-based level 3 BLAS: high-performance model implementations and performance evaluation benchmark. ACM Transactions on Mathematical Software. https://doi.org/10.1145/292395.292412
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.