The DOI matches its Crossref record; 22 of the 22 references it cites were found in a registry or an index.
Minimizing development and maintenance costs in supporting persistently optimized BLAS
Abstract
The Basic Linear Algebra Subprograms (BLAS) define one of the most heavily used performance-critical APIs in scientific computing today. It has long been understood that the most important of these routines, the dense Level 3 BLAS, may be written efficiently given a highly optimized general matrix multiply routine. In this paper, however, we show that an even larger set of operations can be efficiently maintained using a much simpler matrix multiply kernel. Indeed, this is how our own project, ATLAS (which provides one of the most widely used BLAS implementations in use today), supports a large variety of performance-critical routines. Copyright © 2004 John Wiley & Sons, Ltd.
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
FFTW: an adaptive software architecture for the FFT
Frigo, M., & Johnson, S. G. (2002) · Proceedings of the 1998 IEEE International Conference on Acoustics, Speech and Signal Processing, ICASSP '98 (Cat. No.98CH36181) · doi:10.1109/icassp.1998.681704 · Cited by 1,801
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
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
Self-citationAn 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
Self-citationCompiler transformations for high-performance computing
Bacon, D. F., Graham, S. L., & Sharp, O. J. (1994) · ACM Computing Surveys · doi:10.1145/197405.197406 · Cited by 818
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
Anderson, E., Bai, Z., Bischof, C. H., et al. (1999) · Cited by 390
Cited by
Matrix eQTL: ultra fast eQTL analysis via large matrix operations
Shabalin, A. A. (2012) · Bioinformatics · doi:10.1093/bioinformatics/bts163 · Cited by 1,694
Recent developments in the general atomic and molecular electronic structure system
Barca, G. M. J., Bertoni, C., Carrington, L., Datta, D., De Silva, N., Deustua, J. E., Fedorov, D. G., Gour, J. R., Gunina, A. O., Guidez, E., et al. (2020) · The Journal of Chemical Physics · doi:10.1063/5.0005188 · Cited by 1,443
Quantized Convolutional Neural Networks for Mobile Devices
Wu, J., Leng, C., Wang, Y., Hu, Q., & Cheng, J. (2016) · 2016 IEEE Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr.2016.521 · Cited by 1,212
Wu, C., Agarwal, S., Curless, B., & Seitz, S. M. (2011) · CVPR 2011 · doi:10.1109/cvpr.2011.5995552 · Cited by 807
Matrix eQTL: Ultra fast eQTL analysis via large matrix operations
Shabalin, A. A. (2011) · arXiv (Cornell University) · doi:10.17615/g28n-r219 · Cited by 452
Polyhedral parallel code generation for CUDA
Verdoolaege, S., Carlos Juega, J., Cohen, A., Ignacio Gómez, J., Tenllado, C., & Catthoor, F. (2013) · ACM Transactions on Architecture and Code Optimization · doi:10.1145/2400682.2400713 · Cited by 382
PetaBricks: a language and compiler for algorithmic choice
Ansel, J., Chan, C., Wong, Y. L., Olszewski, M., Zhao, Q., Edelman, A., & Amarasinghe, S. (2009) · Proceedings of the 30th ACM SIGPLAN Conference on Programming Language Design and Implementation · doi:10.1145/1542476.1542481 · Cited by 355
Self-Adapting Linear Algebra Algorithms and Software
Demmel, J., Dongarra, J., Eijkhout, V., Fuentes, E., Petitet, A., Vuduc, R., Whaley, R. C., & Yelick, K. (2005) · Proceedings of the IEEE · doi:10.1109/jproc.2004.840848 · Cited by 204
Self-citationToward control of electron transfer in donor-acceptor molecules by bond-specific infrared excitation
Delor, M., Scattergood, P. A., Sazanovich, I. V., Parker, A. W., Greetham, G. M., Meijer, A. J. H. M., Towrie, M., & Weinstein, J. A. (2014) · Science · doi:10.1126/science.1259995 · Cited by 199
High-performance dynamic quantum clustering on graphics processors
Wittek, P. (2013) · Journal of Computational Physics · doi:10.1016/j.jcp.2012.08.048 · Cited by 16
Metadata
- Authors
- Whaley, R. C., & Petitet, A.
- Venue
- Software: Practice and Experience
- Publisher
- Wiley
- Published
- 2005
- Volume
- 35
- Issue
- 2
- Pages
- 101-121
- ISSN
- 0038-0644 (ISSN-L)
- 1097-024X
- OpenAlex
- W2119395117
- Cited by
- 254
- References
- 22
- FWCI
- 16.88
- 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.