Cited by 1,317Parallel Computing and Optimization TechniquesMatrix Theory and AlgorithmsNumerical Methods and Algorithms

The DOI matches its Crossref record; 21 of the 25 references it cites were found in a registry or an index.

Automated empirical optimizations of software and the ATLAS project

Clint Whaley, R., Petitet, Antoine, Dongarra, Jack J.·2001·Parallel Computing

Overview

Integrity signals

Registry

Crossref · 10.1016/s0167-8191(00)00087-9

Cites

21 of 21 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

Citations

Cites

Show all 25 references

Research works printed but not linked: 1

  1. Hanson, 1973, A proposal for standard linear algebra subprograms, ACM SIGNUM Newsl., 8

Cited by

Sorted by citations

Items 701–800 of 1,000

Metadata

Authors
Clint Whaley, R., Petitet, A., & Dongarra, J. J.
Affiliations
University of Tennessee at Knoxville (US)
Corresponding author
Dongarra, Jack J.
Venue
Parallel Computing
Publisher
Elsevier BV
Published
2001-01
Volume
27
Issue
1-2
Pages
3-35
ISSN
0167-8191 (ISSN-L)
OpenAlex
W1964031104
Cited by
1,317
References
25
Citations by year
2026: 9 · 2025: 13 · 2024: 9 · 2023: 25 · 2022: 19 · 2021: 25 · 2020: 39 · 2019: 22 · 2018: 37 · 2017: 37 · 2016: 57 · 2015: 40 · 2014: 78 · 2013: 88 · 2012: 101
FWCI
66.04
Type
journal article
Language
en
Open access
closed
Locations
  • Parallel Computing (publishedVersion)
  • Research Explorer (The University of Manchester) (submittedVersion)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Matrix Theory and Algorithms
  • Physical Sciences › Computer Science › Computational Theory and Mathematics › Numerical Methods and Algorithms
Keywords
ATLAS project, BLAS, linear algebra software, software maintenance, Moore's law

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