The DOI matches its Crossref record; 31 of the 31 references it cites were found in a registry or an index.
BLIS: A Framework for Rapidly Instantiating BLAS Functionality
Abstract
The BLAS-like Library Instantiation Software (BLIS) framework is a new infrastructure for rapidly instantiating Basic Linear Algebra Subprograms (BLAS) functionality. Its fundamental innovation is that virtually all computation within level-2 (matrix-vector) and level-3 (matrix-matrix) BLAS operations can be expressed and optimized in terms of very simple kernels. While others have had similar insights, BLIS reduces the necessary kernels to what we believe is the simplest set that still supports the high performance that the computational science community demands. Higher-level framework code is generalized and implemented in ISO C99 so that it can be reused and/or reparameterized for different operations (and different architectures) with little to no modification. Inserting high-performance kernels into the framework facilitates the immediate optimization of any BLAS-like operations which are cast in terms of these kernels, and thus the framework acts as a productivity multiplier. Users of BLAS-dependent applications are given a choice of using the traditional Fortran-77 BLAS interface, a generalized C interface, or any other higher level interface that builds upon this latter API. Preliminary performance of level-2 and level-3 operations is observed to be competitive with two mature open source libraries (OpenBLAS and ATLAS) as well as an established commercial product (Intel MKL).
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
Anderson, E., Bai, Z., Bischof, C., Blackford, L. S., Demmel, J., Dongarra, J., Du Croz, J., Greenbaum, A., Hammarling, S., McKenney, A., et al. (1999) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9780898719604 · Cited by 4,435
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
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
Algorithm-Based Fault Tolerance for Matrix Operations
Huang, K.-H., & Abraham, J. A. (1984) · IEEE Transactions on Computers · doi:10.1109/tc.1984.1676475 · Cited by 1,283
An extended set of FORTRAN basic linear algebra subprograms
Dongarra, J. J., Du Croz, J., Hammarling, S., & Hanson, R. J. (1988) · ACM Transactions on Mathematical Software · doi:10.1145/42288.42291 · Cited by 887
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
SPIRAL: Code Generation for DSP Transforms
Puschel, M., Moura, J. M. F., Johnson, J. R., Padua, D., Veloso, M. M., Singer, B. W., Xiong, J., Franchetti, F., Gacic, A., Voronenko, Y., et al. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840306 · Cited by 826
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
Optimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
Bilmes, J., Asanovic, K., Chin, C.-W., & Demmel, J. (2014) · 25th Anniversary International Conference on Supercomputing Anniversary Volume - · doi:10.1145/2591635.2667174 · Cited by 453
Numerical linear algebra on emerging architectures: The PLASMA and MAGMA projects
Agullo, E., Demmel, J., Dongarra, J., Hadri, B., Kurzak, J., Langou, J., Ltaief, H., Luszczek, P., & Tomov, S. (2009) · Journal of Physics: Conference Series · doi:10.1088/1742-6596/180/1/012037 · Cited by 420
Anderson, E., Bai, Z., Bischof, C. H., et al. (1999) · Cited by 390
ScaLAPACK: a scalable linear algebra library for distributed memory concurrent computers
Choi, J., Dongarra, J. J., Pozo, R., & Walker, D. W. (2003) · [Proceedings 1992] The Fourth Symposium on the Frontiers of Massively Parallel Computation · doi:10.1109/fmpc.1992.234898 · Cited by 326
A Storage-Efficient $WY$ Representation for Products of Householder Transformations
Schreiber, R., & Van Loan, C. (1989) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0910005 · Cited by 313
High-performance implementation of the level-3 BLAS
Goto, K., & Van De Geijn, R. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1377603.1377607 · Cited by 312
Self-citationOptimizing matrix multiply using PHiPAC: a portable, high-performance, ANSI C coding methodology
Bilmes, J., Asanovic, K., Chin, C.-W., & Demmel, J. (1997) · Proceedings of the 11th international conference on Supercomputing - ICS '97 · doi:10.1145/263580.263662 · Cited by 308
The WY representation for products of householder matrices
Bischof, C., & Van Loan, C. (1987) · SIAM Journal on Scientific and Statistical Computing · doi:10.1137/0908009 · Cited by 295
Gunnels, J. A., Gustavson, F. G., Henry, G., & Geijn, R. A. (2001) · ACM Transactions on Mathematical Software · doi:10.1145/504210.504213 · Cited by 235
Elemental: A New Framework for Distributed Memory Dense Matrix Computations
Poulson, J., Marker, B., van de Geijn, R. A., Hammond, J. R., & Romero, N. A. (2013) · ACM Transactions on Mathematical Software · doi:10.1145/2427023.2427030 · Cited by 209
Self-citationGEMM-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
LU, QR and Cholesky Factorizations using Vector Capabilities of GPUs
Volkov, V. M., & Demmel, J. W. (2008) · UC Berkeley · Cited by 169
The science of deriving dense linear algebra algorithms
Bientinesi, P., Gunnels, J. A., Myers, M. E., Quintana-Ortí, E. S., & Geijn, R. A. V. D. (2005) · ACM Transactions on Mathematical Software · doi:10.1145/1055531.1055532 · Cited by 159
Is Search Really Necessary to Generate High-Performance BLAS?
Yotov, K., Li, X., Ren, G., Garzarán, M. J., Padua, D., Pingali, K. K., & Stodghill, P. V. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840444 · Cited by 151
Exploiting functional parallelism of POWER2 to design high-performance numerical algorithms
Agarwal, R. C., Gustavson, F. G., & Zubair, M. (1994) · IBM Journal of Research and Development · doi:10.1147/rd.385.0563 · Cited by 69
Codesign Tradeoffs for High-Performance, Low-Power Linear Algebra Architectures
Pedram, A., Geijn, R. A., & Gerstlauer, A. (2012) · IEEE Transactions on Computers · doi:10.1109/tc.2012.132 · Cited by 57
A Family of High-Performance Matrix Multiplication Algorithms
Gunnels, J. A., Gustavson, F. G., Henry, G., & Geijn, R. A. (2006) · Lecture notes in computer science · doi:10.1007/11558958_30 · Cited by 52
Accumulating Householder transformations, revisited
Joffrain, T., Low, T. M., Quintana–Ort́ı, E. S., Geijn, R. A., & Zee, F. G. (2006) · ACM Transactions on Mathematical Software · doi:10.1145/1141885.1141886 · Cited by 44
Cache efficient bidiagonalization using BLAS 2.5 operators
Howell, G., Demmel, J. W., Fulton, C. T., Hammarling, S. J., & Marmol, K. (2008) · ACM Transactions on Mathematical Software · doi:10.1145/1356052.1356055 · Cited by 29
Agullo, E., Bouwmeester, H., Dongarra, J. J., Jakub Kurzak, A., Langou, J., & Rosenberg, L. (2011) · Lecture notes in computer science · doi:10.1007/978-3-642-19328-6_14 · Cited by 20
Restructuring the Tridiagonal and Bidiagonal QR Algorithms for Performance
Zee, F. G., Geijn, R. A., & Quintana‐Ortí, G. (2014) · ACM Transactions on Mathematical Software · doi:10.1145/2535371 · Cited by 17
Families of Algorithms for Reducing a Matrix to Condensed Form
Zee, F. G., Geijn, R. A., Quintana‐Ortí, G., & Elizondo, G. J. (2012) · ACM Transactions on Mathematical Software · doi:10.1145/2382585.2382587 · Cited by 10
Cited by
Triton: an intermediate language and compiler for tiled neural network computations
Tillet, P., Kung, H. T., & Cox, D. (2019) · Proceedings of the 3rd ACM SIGPLAN International Workshop on Machine Learning and Programming Languages · doi:10.1145/3315508.3329973 · Cited by 318
Metadata
- Authors
- Van Zee, F. G., & van de Geijn, R. A.
- Venue
- ACM Transactions on Mathematical Software
- Published
- 2015-06
- Volume
- 41
- Issue
- 3
- Pages
- 1-33
- ISSN
- 0098-3500 (ISSN-L)
- 1557-7295
- OpenAlex
- W2252007067
- Cited by
- 356
- References
- 31
- FWCI
- 29.61
- 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.